12 search results - page 2 / 3 » An Isomorphism Between Cut-Elimination Procedure and Proof R... |
TABLEAUX
2009
Springer
13 years 11 months ago
2009
Springer
We consider two sequent calculi for tense logic in which the syntactic judgements are nested sequents, i.e., a tree of traditional onesided sequents built from multisets of formula...
RTA
2004
Springer
13 years 10 months ago
2004
Springer
Logical systems in natural deduction style are usually presented in the Gentzen style. A different definition of natural deduction, that corresponds more closely to proofs in ord...
IPL
2008
13 years 5 months ago
2008
Abstract. We establish linear-time reductions between the minimization of a deterministic finite automaton (DFA) and the conjunction of 3 subproblems: the minimization of a strongl...
CADE
2008
Springer
14 years 5 months ago
2008
Springer
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
POPL
2003
ACM
14 years 5 months ago
2003
ACM
We introduce a new framework of algebraic pure type systems in which we consider rewrite rules as lambda terms with patterns and rewrite rule application as abstraction applicatio...