4 search results - page 1 / 1 » Approaches to Polymorphism in Classical Sequent Calculus |
ESOP
2006
Springer
13 years 8 months ago
2006
Springer
FROCOS
2000
Springer
13 years 8 months ago
2000
Springer
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...
PADL
2004
Springer
13 years 10 months ago
2004
Springer
Gentzen’s Hauptsatz – cut elimination theorem – in sequent calculi reveals a fundamental property on logic connectives in various logics such as classical logic and intuition...
ENTCS
2008
13 years 4 months ago
2008
The better known methods of semantic tableaux for deciding satisfiability in propositional linear temporal logic generate graphs in addition to classical trees. The test of satisf...