Sciweavers

3690 search results - page 3 / 738
» Computation with classical sequents
Sort
View
FROCOS
2000
Springer
13 years 11 months ago
Structured Sequent Calculi for Combining Intuitionistic and Classical First-Order Logic
We define a sound and complete logic, called FO , which extends classical first-order predicate logic with intuitionistic implication. As expected, to allow the interpretation of i...
Paqui Lucio
ESOP
2006
Springer
13 years 11 months ago
Approaches to Polymorphism in Classical Sequent Calculus
Alexander J. Summers, Steffen van Bakel
CIE
2006
Springer
13 years 11 months ago
LJQ: A Strongly Focused Calculus for Intuitionistic Logic
LJQ is a focused sequent calculus for intuitionistic logic, with
Roy Dyckhoff, Stéphane Lengrand
LICS
2007
IEEE
14 years 1 months ago
Principles of Superdeduction
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...
Paul Brauner, Clément Houtmann, Claude Kirc...
CSL
2009
Springer
14 years 2 months ago
Focalisation and Classical Realisability
We develop a polarised variant of Curien and Herbelin’s ¯λµ˜µ calculus suitable for sequent calculi that admit a focalising cut elimination (i.e. whose proofs are focalised ...
Guillaume Munch-Maccagnoni