Abstract
In this work we present goal-directed calculi for the Gödel-Dummett logic LC and its finite-valued counterparts, LCn (n ≥ 2). We introduce a terminating hypersequent calculus for the implicational fragment of LC with local rules and a single identity axiom. We also give a labelled goal-directed calculus with invertible rules and show that it is co-NP. Finally we derive labelled goal-directed calculi for LCn. © Springer-Verlag Berlin Heidelberg 2003.
Author supplied keywords
Cite
CITATION STYLE
Metcalfe, G., Olivetti, N., & Gabbay, D. (2003). Goal-directed calculi for Gödel-Dummett logics. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2803, 413–426. https://doi.org/10.1007/978-3-540-45220-1_33
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
