𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Proof-finding Algorithms for Classical and Subclassical Propositional Logics

✍ Scribed by Bunder, M. W.; Rizkalla, R. M.

Book ID
121809453
Publisher
University of Notre Dame
Year
2009
Tongue
English
Weight
193 KB
Volume
50
Category
Article
ISSN
0029-4527

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

[Lecture Notes in Computer Science] Foun
[Lecture Notes in Computer Science] Foundations of Information and Knowledge Systems Volume 4932 || Algorithms for Effective Argumentation in Classical Propositional Logic: A Connection Graph Approach
✍ Hartmann, Sven; Kern-Isberner, Gabriele πŸ“‚ Article πŸ“… 2008 πŸ› Springer Berlin Heidelberg 🌐 English βš– 477 KB

An ideal text for researchers and professionals alike, this book constitutes the refereed proceedings of the 5th International Symposium on Foundations of Information and Knowledge Systems, FoIKS 2008 held in Pisa, Italy, in February 2008. The 13 revised full papers are presented together with nine

Simple proof of the completeness theorem
Simple proof of the completeness theorem for second-order classical and intuitionistic logic by reduction to first-order mono-sorted logic
✍ Karim Nour; Christophe Raffalli πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 241 KB

We present a simpler way than usual to deduce the completeness theorem for the second-order classical logic from the ΓΏrst-order one. We also extend our method to the case of second-order intuitionistic logic.