Decomposition proof systems for Gödel-Dummett logics

DOI10.1023/A:1013813806341zbMath1010.03020OpenAlexW2030232034MaRDI QIDQ5955614

Beata Konikowska, Arnon Avron

Publication date: 17 June 2002

Published in: Studia Logica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1013813806341

zbMATH Keywords

normal formcomplete Gentzen-type systemsGödel-Dummett propositional logic

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Cut-elimination and normal-form theorems (03F05) Many-valued logic (03B50) Proof theory in general (including proof-theoretic semantics) (03F03) Intermediate logics (03B55)

Related Items (10)

Constraint tableaux for two-dimensional fuzzy logics ⋮ Graph-based decision for Gödel-Dummett logics ⋮ Normal forms for fuzzy logics: a proof-theoretic approach ⋮ Proof search and co-NP completeness for many-valued logics ⋮ A Multiple-Conclusion Calculus for First-Order Gödel Logic ⋮ Quantifier-free logic for multialgebraic theories ⋮ Decision methods for linearly ordered Heyting algebras ⋮ Fast decision procedure for propositional Dummett logic based on a multiple premise tableau calculus ⋮ Paraconsistent Gödel modal logic ⋮ Terminating calculi for propositional Dummett logic with subformula property

This page was built for publication: Decomposition proof systems for Gödel-Dummett logics