Skip to main content
Article
Proof-finding algorithms for classical and subclassical propositional logics
Notre Dame Journal of Formal Logic
  • Martin W Bunder, University of Wollongong
  • Ramzy M Rizkalla
Document Type
Journal Article
Publication Date
1-1-2009
Abstract
The formulas-as-types isomorphism tells us that every proof and theorem, in the intuitionistic implicational logic H , 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 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.
RIS ID
29686
Citation Information
Martin W Bunder and Ramzy M Rizkalla. "Proof-finding algorithms for classical and subclassical propositional logics" Notre Dame Journal of Formal Logic Vol. 50 Iss. 3 (2009) p. 261 - 273
Available at: http://works.bepress.com/mbunder/4/