David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
Notre Dame Journal of Formal Logic 50 (3):261-273 (2009)
The formulas-as-types isomorphism tells us that every proof and theorem, in the intuitionistic implicational logic $H_\rightarrow$, corresponds to a lambda term or combinator and its type. The algorithms of Bunder very efficiently find a lambda term inhabitant, if any, of any given type of $H_\rightarrow$ and of many of its subsystems. In most cases the search procedure has a simple bound based roughly on the length of the formula involved. Computer implementations of some of these procedures were done in Dekker. In this paper we extend these methods to full classical propositional logic as well as to its various subsystems. This extension has partly been implemented by Oostdijk
|Keywords||proof-finding algorithms propositional logics|
|Categories||categorize this paper)|
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library|
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
Franz Baader & Ulrike Sattler (2001). An Overview of Tableau Algorithms for Description Logics. Studia Logica 69 (1):5-40.
Alexander S. Karpenko (2000). The Classification of Propositional Calculi. Studia Logica 66 (2):253-271.
Marta Bílková (2007). Uniform Interpolation and Propositional Quantifiers in Modal Logics. Studia Logica 85 (1):1 - 31.
Nathan Segerlind (2007). The Complexity of Propositional Proofs. Bulletin of Symbolic Logic 13 (4):417-481.
Vladimir V. Rybakov (2011). Best Unifiers in Transitive Modal Logics. Studia Logica 99 (1-3):321-336.
Luca Viganò (2000). Labelled Non-Classical Logics. Kluwer Academic Publishers.
Greg Restall (1998). Displaying and Deciding Substructural Logics 1: Logics with Contraposition. [REVIEW] Journal of Philosophical Logic 27 (2):179-216.
Ewa Orlowska (1992). Relational Proof System for Relevant Logics. Journal of Symbolic Logic 57 (4):1425-1440.
A. Avron (2000). Implicational F-Structures and Implicational Relevance Logics. Journal of Symbolic Logic 65 (2):788-802.
Mauro Ferrari & Pierangelo Miglioli (1993). Counting the Maximal Intermediate Constructive Logics. Journal of Symbolic Logic 58 (4):1365-1401.
Petr Hájek & Petr Cintula (2006). On Theories and Models in Fuzzy Predicate Logics. Journal of Symbolic Logic 71 (3):863 - 880.
A. Carbone (2002). The Cost of a Cycle is a Square. Journal of Symbolic Logic 67 (1):35-60.
Added to index2010-09-13
Total downloads5 ( #256,056 of 1,410,150 )
Recent downloads (6 months)1 ( #177,743 of 1,410,150 )
How can I increase my downloads?