Embedding friendly first-order paradefinite and connexive logics

DOI10.1007/S10992-022-09659-3OpenAlexW4224444481MaRDI QIDQ2079706

Norihiro Kamide

Publication date: 30 September 2022

Published in: Journal of Philosophical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10992-022-09659-3

zbMATH Keywords

embeddingcompletenesscut-eliminationconnexive logicparadefinite logic

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ideal paraconsistent logics
• Proof theory of Nelson's paraconsistent logic: a uniform perspective
• Kripke-completeness and cut-elimination theorems for intuitionistic paradefinite logics with and without quasi-explosion
• Intuitionistic logic with strong negation
• The value of the four values
• The logic of information structures
• 40 years of FDE: an introductory overview
• Four-valued paradefinite logics
• Handbook of philosophical logic. Vol. 6
• Intuitive semantics for first-degree entailments and `coupled trees'
• Reasoning with logical bilattices
• Modal extension of ideal paraconsistent four-valued logic and its subsystem
• Completeness and cut-elimination for first-order ideal paraconsistent four-valued logic
• Embedding from multilattice logic into classical logic and vice versa
• Notes on Craig interpolation for LJ with strong negation
• Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory
• Constructible falsity and inexact predicates
• New Essays on Belnap-Dunn Logic
• Yet another paradefinite logic: The role of conflation1
• Connexive implication
• A propositional logic with subjunctive conditionals
• Constructible falsity

This page was built for publication: Embedding friendly first-order paradefinite and connexive logics