A tableau system for Gödel-Dummett Logic based on a hypersequent calculus

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We present a terminating contraction-free calculus GLC z.ast; for the propositional fragment of Gödel-Dummett Logic LC. GLC z.ast; uses hypersequents, and unlike other Gentzen-type calculi for LC, all its rules have at most two premises. These rules are all invertible. Hence it can be used as a basis for a deterministic tableau system for LC. This tableau system is presented in the last section.

Original languageEnglish
Title of host publicationAutomated Reasoning with Analytic Tableaux and Related Methods - International Conference, TABLEAUX 2000, Proceedings
Pages98-111
Number of pages14
DOIs
StatePublished - 2000
EventInternational Conference on Automated Reasoning with Analytic Tableaux and Related Methods, TABLEAUX 2000 - St Andrews, Scotland, United Kingdom
Duration: 3 Jul 20007 Jul 2000

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1847 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceInternational Conference on Automated Reasoning with Analytic Tableaux and Related Methods, TABLEAUX 2000
Country/TerritoryUnited Kingdom
CitySt Andrews, Scotland
Period3/07/007/07/00

Fingerprint

Dive into the research topics of 'A tableau system for Gödel-Dummett Logic based on a hypersequent calculus'. Together they form a unique fingerprint.

Cite this