TY - GEN
T1 - A hypersequent system for Gödel-Dummett logic with non-constant domains
AU - Tiu, Alwen
PY - 2011
Y1 - 2011
N2 - Gödel-Dummett logic is an extension of first-order intuitionistic logic with the linearity axiom (A ⊃ B) V (B ⊃ A), and the so-called "quantifier shift" axiom ∀x (A V B(xx)) ⊃ A V ∀xB(x). Semantically, it can be characterised as a logic for linear Kripke frames with constant domains. Gödel-Dummett logic has a natural formalisation in hypersequent calculus. However, if one drops the quantifier shift axiom, which corresponds to the constant domain property, then the resulting logic has to date no known hypersequent formalisation. We consider an extension of hypersequent calculus in which eigenvariables in the hypersequents form an explicit part of the structures of the hypersequents. This extra structure allows one to formulate quantifier rules which are more refined. We give a formalisation of Gödel-Dummett logic without the assumption of constant domain in this extended hypersequent calculus. We prove cut elimination for this hypersequent system, and show that it is sound and complete with respect to its Hilbert axiomatic system.
AB - Gödel-Dummett logic is an extension of first-order intuitionistic logic with the linearity axiom (A ⊃ B) V (B ⊃ A), and the so-called "quantifier shift" axiom ∀x (A V B(xx)) ⊃ A V ∀xB(x). Semantically, it can be characterised as a logic for linear Kripke frames with constant domains. Gödel-Dummett logic has a natural formalisation in hypersequent calculus. However, if one drops the quantifier shift axiom, which corresponds to the constant domain property, then the resulting logic has to date no known hypersequent formalisation. We consider an extension of hypersequent calculus in which eigenvariables in the hypersequents form an explicit part of the structures of the hypersequents. This extra structure allows one to formulate quantifier rules which are more refined. We give a formalisation of Gödel-Dummett logic without the assumption of constant domain in this extended hypersequent calculus. We prove cut elimination for this hypersequent system, and show that it is sound and complete with respect to its Hilbert axiomatic system.
UR - https://www.scopus.com/pages/publications/79959748563
U2 - 10.1007/978-3-642-22119-4_20
DO - 10.1007/978-3-642-22119-4_20
M3 - Conference Paper
SN - 9783642221187
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 248
EP - 262
BT - Automated Reasoning with Analytic Tableaux and Related Methods - 20th International Conference, TABLEAUX 2011, Proceedings
T2 - 20th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods, TABLEAUX 2011
Y2 - 4 July 2011 through 8 July 2011
ER -