Algebraic Completeness Results for Dummett's LC and Its Extensions
From MaRDI portal
Publication:5665173
DOI10.1002/malq.19710170126zbMath0252.02018OpenAlexW1971314708MaRDI QIDQ5665173
J. Michael Dunn, Robert K. Meyer
Publication date: 1971
Published in: Mathematical Logic Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/malq.19710170126
Related Items (33)
IN MEMORIAM: J. MICHAEL DUNN, 1941–2021 ⋮ Linear Logic Properly Displayed ⋮ First-order nilpotent minimum logics: first steps ⋮ Hypersequents, logical consequence and intermediate logics for concurrency ⋮ The logic of the strongest and the weakest t-norms ⋮ Epimorphisms in varieties of residuated structures ⋮ A category equivalence for odd Sugihara monoids and its applications ⋮ A pretabular classical relevance logic ⋮ Nonfinitely approximable intuitionistic modal logics ⋮ Strong decidability and strong recognizability ⋮ A second pretabular classical relevance logic ⋮ Nilpotent Minimum Logic NM and Pretabularity ⋮ First-order satisfiability in Gödel logics: an NP-complete fragment ⋮ A simple Henkin-style completeness proof for Gödel 3-valued logic G3 ⋮ $$\mathbf {RM}$$ RM and its Nice Properties ⋮ LC and Its Pretabular Relatives ⋮ A semantic hierarchy for intuitionistic logic ⋮ Slices and levels of extensions of the minimal logic ⋮ Two pretabular linear extensions of relevance logic R ⋮ The tabularity problem over the minimal logic ⋮ AGGREGATION AND IDEMPOTENCE ⋮ Pretabular superintuitionistic logic ⋮ Fragments of R-mingle ⋮ A Kripke-style semantics for R-mingle using a binary accessibility relation ⋮ Matrix approach in methodology of sentential calculi ⋮ A generalized proof-theoretic approach to logical argumentation based on hypersequents ⋮ Equational axioms for classes of Heyting algebras ⋮ Quantification and RM ⋮ Maksimova, Relevance and the Study of Lattices of Non-classical Logics ⋮ Continuous Fraïssé conjecture ⋮ Simple axiomatizations for pretabular classical relevance logics ⋮ Connecting fuzzy logic and argumentation frames via logical attack principles ⋮ Terminating calculi for propositional Dummett logic with subformula property
This page was built for publication: Algebraic Completeness Results for Dummett's LC and Its Extensions