551 search results - page 25 / 111 » Natural proofs |
LFCS
2007
Springer
14 years 4 months ago
2007
Springer
We introduce a natural deduction formulation for the Logic of Proofs, a refinement of modal logic S4 in which the assertion PA is replaced by [[s]]A whose intended reading is “s...
JAR
2007
13 years 9 months ago
2007
Abstract. We illustrate a methodology for formalizing and reasoning about Abadi and Cardelli’s object-based calculi, in (co)inductive type theory, such as the Calculus of (Co)Ind...
VMCAI
2007
Springer
14 years 4 months ago
2007
Springer
Interpolation is an important component of recent methods for program verification. It provides a natural and effective means for computing separation between the sets of ‘good...
CSL
2005
Springer
14 years 3 months ago
2005
Springer
Recent work establishes a direct link between the complexity of a linear logic proof in terms of the exchange rule and the topological complexity of its corresponding proof net, ex...
SLOGICA
1998
13 years 9 months ago
1998
We present and discuss various formalizations of Modal Logics in Logical Frameworks based on Type Theories. We consider both Hilbert- and Natural Deductionstyle proof systems for ...