Inferential-connexive mixed logics

DOI10.1093/JIGPAL/JZAE116MaRDI QIDQ6893396zbMATH OpenFDO

Authors Federico Matias Pailos

Publication date 26 November 2025

Published in Logic Journal of the IGPL (Search for Journal in Brave)

zbMATH Keywords

Boolean logicsconnexive logicmixed logicsStrong-Kleene logics

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Computer science (68-XX)

Cites work

• scientific article; zbMATH DE number 3648682 (Why is no real title available?)
• A fully classical truth theory characterized by substructural means
• A hierarchy of classical and paraconsistent logics
• Boolean connexive logics: semantics and tableau approach
• Characterizing logical consequence in many-valued logic
• Classical logic and the strict tolerant hierarchy
• Classical logic is connexive
• Connexive Gentzen
• Connexive conditional logic. I
• Disjoint logics
• Empty logics
• Humble connexivity
• Inferential constants
• Logics of nonsense and Parry systems
• Negation as cancellation, and connexive logic
• Negation as cancellation, connexive logic, and qLPm
• On all pure three-valued logics
• ST, LP and tolerant metainferences
• Semantical analyses of propositional systems of Fitch and Nelson
• Tolerant, classical, strict
• Validities, antivalidities and contingencies: a multi-standard approach

This page was built for publication: Inferential-connexive mixed logics

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