Decision methods for linearly ordered Heyting algebras
From MaRDI portal
Publication:2491077
DOI10.1007/s00153-005-0321-zzbMath1093.03005OpenAlexW2006400179MaRDI QIDQ2491077
Publication date: 26 May 2006
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00153-005-0321-z
Heyting algebras (lattice-theoretic aspects) (06D20) Decidability of theories and sets of sentences (03B25)
Related Items
The intensional side of algebraic-topological representation theorems, Proof analysis in intermediate logics, Intuitionistic Decision Procedures Since Gentzen, A Multiple-Conclusion Calculus for First-Order Gödel Logic, In the Shadows of the Löwenheim-Skolem Theorem: Early Combinatorial Analyses of Mathematical Proofs, From mathematical axioms to mathematical rules of proof: recent developments in proof analysis
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Proof-theoretical analysis of order relations
- Proof theory for linear lattices
- Semantic trees for Dummett's logic LC
- Untersuchungen über das logische Schliessen. I
- Skolem's discovery of Gödel-Dummett logic
- Beyond two: Theory and applications of multiple-valued logic
- Ordered algebraic structures. Proceedings of the conference on lattice-ordered groups and \(f\)-rings held at the University of Florida, Gainesville, FL, USA, February 28--March 3, 2001
- Automated reasoning. Second international joint conference, IJCAR 2004, Cork, Ireland, July 4--8, 2004. Proceedings.
- A propositional calculus with denumerable matrix
- Logics without the contraction rule
- Contraction-free sequent calculi for intuitionistic logic
- A deterministic terminating sequent calculus for Godel-Dummett logic
- The finite model property for various fragments of intuitionistic linear logic
- An O(n log n)-Space Decision Procedure for Intuitionistic Propositional Logic
- Editorial
- Duplication-free tableau calculi and related cut-free sequent calculi for the interpolable propositional intermediate logics
- Space-efficient Decision Procedures for Three Interpolable Propositional Intermediate Logics
- Proof systems for lattice theory
- On the elementary theory of linear order
- Logic with truth values in A linearly ordered heyting algebra
- Undecidability of some simple formalized theories
- Decomposition proof systems for Gödel-Dummett logics
