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 smdy 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.