A Hypersequent System for Gödel-Dummett Logic with Non-constant Domains
From MaRDI portal
Publication:3010373
DOI10.1007/978-3-642-22119-4_20zbMath1333.03088MaRDI QIDQ3010373
Publication date: 1 July 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1885/39445
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Gentzen calculi for the existence predicate
- Cut elimination inside a deep inference system for classical predicate logic
- Completeness theorem for Dummett's LC quantified and some of its extensions
- Hypersequents, logical consequence and intermediate logics for concurrency
- Cut-elimination for a logic with definitions and induction
- A proof-theoretical investigation of global intuitionistic (fuzzy) logic
- Displaying modal logic
- A propositional calculus with denumerable matrix
- A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification
- A Cut‐Free Calculus For Dummett's LC Quantified
- A deterministic terminating sequent calculus for Godel-Dummett logic
- Duplication-free tableau calculi and related cut-free sequent calculi for the interpolable propositional intermediate logics
- Hypersequent Calculi for Godel Logics -- a Survey
- How to Universally Close the Existential Rule
- A Local System for Intuitionistic Logic
- A Note on Linear Kripke Models
- Logic and structure
- Solution to a problem of Ono and Komori
