75 search results - page 3 / 15 » Abstract Interpretation of Proofs: Classical Propositional C... |
151
click to vote
LICS
2010
IEEE
15 years 4 months ago
2010
IEEE
This work belongs to a wider effort aimed at eliminating syntactic bureaucracy from proof systems. In this paper, we present a novel cut elimination procedure for classical propos...
214
click to vote
ICFP
2012
ACM
13 years 8 months ago
2012
ACM
Continuing a line of work by Abramsky (1994), by Bellin and Scott (1994), and by Caires and Pfenning (2010), among others, this paper presents CP, a calculus in which propositions...
140
click to vote
APAL
2010
15 years 5 months ago
2010
Classical proof forests are a proof formalism for first-order classical logic based on Herbrand's Theorem and backtracking games in the style of Coquand. First described by M...
195
click to vote
TABLEAUX
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Bi-intuitionistic logic is a conservative extension of intuitionistic logic with a connective dual to implication, called exclusion. We present a sound and complete cut-f...
151
click to vote
CSL
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. For a reasonable sound and complete proof calculus for firstorder logic consider the problem to decide, given a sentence of firstorder logic and a natural number n, whet...