8 search results - page 2 / 2 » Strong Normalisation of Cut-Elimination in Classical Logic |
TLCA
2005
Springer
14 years 27 days ago
2005
Springer
Abstract. We present a theory of proof denotations in classical propologic. The abstract definition is in terms of a semiring of weights, and two concrete instances are explored. ...
APAL
2010
13 years 7 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...
LICS
2007
IEEE
14 years 1 months ago
2007
IEEE
In predicate logic, the proof that a theorem P holds in a theory Th is typically conducted in natural deduction or in the sequent calculus using all the information contained in t...