Decomposition proof systems for gödel-dummett logics

Arnon Avron*, Beata Konikowska

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

26 Scopus citations

Abstract

The main goal of the paper is to suggest some analytic proof systems for LC and its finite-valued counterparts which are suitable for proof-search. This goal is achieved through following the general Rasiowa-Sikorski methodology for constructing analytic proof systems for semantically-defined logics. All the systems presented here are terminating, contraction-free, and based on invertible rules, which have a local character and at most two premises.

Original languageEnglish
Pages (from-to)197-219
Number of pages23
JournalStudia Logica
Volume69
Issue number2
DOIs
StatePublished - 2001

Funding

FundersFunder number
ESPRIT
FP7 International Cooperation

    Keywords

    • Analytic rules
    • Decomposition Systems
    • Fuzzy Logics
    • Gentzen-type systems
    • Gödel Logics
    • Hypersequents
    • Intermediate Logics
    • Tableaux

    Fingerprint

    Dive into the research topics of 'Decomposition proof systems for gödel-dummett logics'. Together they form a unique fingerprint.

    Cite this