19 search results - page 3 / 4 » Strong Normalization of the Dual Classical Sequent Calculus |
133
click to vote
ICFP
2003
ACM
16 years 4 months ago
2003
ACM
All classical -terms typable with disjunctive normal forms are shown to share a common computational behavior: they implement a local exception handling mechanism whose exact work...
177
click to vote
TABLEAUX
2009
Springer
15 years 9 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...
125
Voted
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...
160
click to vote
TLCA
2005
Springer
15 years 10 months 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. ...
167
click to vote
CTCS
1987
Springer
15 years 8 months ago
1987
Springer
A typed lambda calculus with categorical type constructors is introduced. It has a uniform category theoretic mechanism to declare new types. Its type structure includes categoric...