Introduction to mathematical logic (3rd ed.)
Introduction to mathematical logic (3rd ed.)
Modern heuristic techniques for combinatorial problems
Modern heuristic techniques for combinatorial problems
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
A Milestone Reached and a Secret Revealed
Journal of Automated Reasoning
Finding Shortest Proofs: An Application of Linked Inference Rules
Journal of Automated Reasoning
Distributivity in Łℵ0 and Other Sentential Logics
Journal of Automated Reasoning
Solving Open Questions and Other Challenge Problems Using Proof Sketches
Journal of Automated Reasoning
Conquering the Meredith Single Axiom
Journal of Automated Reasoning
Journal of Automated Reasoning
Journal of Automated Reasoning
A Shortest 2-Basis for Boolean Algebra in Terms of the Sheffer Stroke
Journal of Automated Reasoning
Hi-index | 0.00 |
Since the first presentation of classical sentential logic as an iaxiomatic system by Frege in 1879, the study of a variety of sentential calculi has flourished. One major area of investigation, initiated by Łukasiewicz and his colleagues in the first half of the twentieth century and carried into the second half by Meredith, Thomas, Prior, et al., focuses on alternative axiom sets for such logics, and on formal proofs within them. This paper recalls a sampling of the results obtained heretofore, noting along the way how the papers in this special issue of the iJournal of Automated Reasoning fit into that larger tradition of which they now form a part. It also suggests a number of further questions, open problems, and projects to which the methods developed in these papers seem ideally suited and might well be fruitfully applied.