A Multiple-Conclusion Calculus for First-Order Gödel Logic

DOI10.1007/978-3-642-20712-9_36zbMATH Open1332.03004OpenAlexW114142788MaRDI QIDQ3007648FDOQ3007648

Arnon Avron, Ori Lahav

Publication date: 17 June 2011

Published in: Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-20712-9_36

Mathematics Subject Classification ID

Many-valued logic (03B50) Cut-elimination and normal-form theorems (03F05)

Cites Work

• Title not available (Why is that?)
• Metamathematics of fuzzy logic
• A propositional calculus with denumerable matrix
• Semantical investigations in Heyting's intuitionistic logic
• Proof theory for fuzzy logics
• Intuitionistic fuzzy logic and intuitionistic fuzzy set theory
• Hypersequent Calculi for Godel Logics -- a Survey
• Gentzen-type systems, resolution and tableaux
• Hypersequents, logical consequence and intermediate logics for concurrency
• First-order Gödel logics
• Duplication-free tableau calculi and related cut-free sequent calculi for the interpolable propositional intermediate logics
• Decision methods for linearly ordered Heyting algebras
• A deterministic terminating sequent calculus for Godel-Dummett logic
• Decomposition proof systems for Gödel-Dummett logics
• A Simple Proof of Completeness and Cut-admissibility for Propositional Godel Logic
• Semantic trees for Dummett's logic LC

Cited In (5)

• A Generalisation of the Hyperresolution Principle to First Order Gödel Logic
• A semantic proof of strong cut-admissibility for first-order Godel logic
• Hypersequent Calculi for Godel Logics -- a Survey
• Title not available (Why is that?)
• Computer Science Logic

This page was built for publication: A Multiple-Conclusion Calculus for First-Order Gödel Logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3007648)