Analytic Methods for the Logic of Proofs

The logic of proofs (lp) was proposed as Godel's missed link between Intuitionistic and S4-proofs, but so far the tableau-based methods proposed for lp have not explored this closeness with S4 and contain rules whose analycity is not immediately evident. We study possible formulations of analytic tableau proof methods for lp that preserve the subformula property. Two sound and complete tableau decision methods of increasing degree of analycity are proposed, KELP and preKELP. The latter is particularly inspired on S4-proofs. The crucial role of proof constants in the structure of lp-proofs methods is analysed. In particular, a method for the abduction of proof constant specifications in strongly analytic preKELP proofs is presented; abduction heuristics and the complexity of the method are discussed.

[1]  S. Shelah,et al.  Annals of Pure and Applied Logic , 1991 .

[2]  Melvin Fitting.  Realizations and LP , 2009, Ann. Pure Appl. Log..

[3]  Sergei N. Artemovy.  Operational Modal Logic , 1995 .

[4]  Alexey Mkrtychev,et al.  Models for the Logic of Proofs , 1997, LFCS.

[5]  M. Fitting.  S4LP and Local Realizability , 2007 .

[6]  Nissim Francez,et al.  Basic simple type theory , 1998 .

[7]  Marcello D'Agostino,et al.  The Taming of the Cut. Classical Refutations with Analytic Cut , 1994, J. Log. Comput..

[8]  Marcello D'Agostino,et al.  Are tableaux an improvement on truth-tables? , 1992, J. Log. Lang. Inf..

[9]  Richard E. Ladner,et al.  The Computational Complexity of Provability in Systems of Modal Propositional Logic , 1977, SIAM J. Comput..

[10]  Raymond M. Smullyan,et al.  Analytic cut , 1969, Journal of Symbolic Logic (JSL).

[11]  B. Renne.  Tableaux for the Logic of Proofs , 2004 .

[12]  M. Fitting.  Proof Methods for Modal and Intuitionistic Logics , 1983 .

[13]  Sergei N. Artëmov.  Explicit provability and constructive semantics , 2001, Bull. Symb. Log..

[14]  Roman Kuznets.  On the Complexity of Explicit Modal Logics , 2000, CSL.

[15]  Marcello D'Agostino,et al.  Tableau Methods for Classical Propositional Logic , 1999 .

[16]  Fabio Massacci,et al.  Single Step Tableaux for Modal Logics , 2000, Journal of Automated Reasoning.

[17]  Melvin Fitting,et al.  The logic of proofs, semantically , 2005, Ann. Pure Appl. Log..

[18]  Roman Kuznets,et al.  Making knowledge explicit: How hard it is , 2006, Theor. Comput. Sci..

[19]  Nikolai V. Krupski,et al.  On the complexity of the reflected logic of proofs , 2006, Theor. Comput. Sci..