Abstract | ||
---|---|---|
We give a short proof-theoretic treatment of a terminating contraction-free calculus G4-LC for the zero-order Gödel-Dummett logic LC. This calculus is a slight variant of a calculus given by Avellone et al, who show its completeness by model-theoretic techniques. In our calculus, all the rules of G4-LC are invertible, thus allowing a deterministic proof-search procedure. |
Year | DOI | Venue |
---|---|---|
1999 | 10.1093/jigpal/7.3.319 | Logic Journal of the IGPL |
Keywords | Field | DocType |
sequent calculus,contraction-free,terminating,Gödel-Dummett logic | Discrete mathematics,Natural deduction,Structural proof theory,Proof calculus,Sequent calculus,Noncommutative logic,Sequent,Cut-elimination theorem,Calculus,Mathematics,Curry–Howard correspondence | Journal |
Volume | Issue | ISSN |
7 | 3 | 1367-0751 |
Citations | PageRank | References |
29 | 2.42 | 3 |
Authors | ||
1 |
Name | Order | Citations | PageRank |
---|---|---|---|
Roy Dyckhoff | 1 | 452 | 49.09 |