Inconsistent models (and infinite models) for arithmetics with constructible falsity

DOI10.12775/LLP.2018.011MaRDI QIDQ3387886zbMATH OpenOpenAlexWikidataFDO

Authors Thomas Macaulay Ferguson

Publication date 8 January 2021

Published in Logic and Logical Philosophy (Search for Journal in Brave)

Full work available at URL https://doi.org/10.12775/llp.2018.011

zbMATH Keywords

connexive arithmeticconnexive logicconstructible falsityfirst-order arithmeticparaconsistent logicpost consistencystrong negation

Mathematics Subject Classification ID

Paraconsistent logics (03B53) First-order arithmetic and fragments (03F30)

Recommendations

• On paraconsistent downward Löwenheim-Skolem theorems
• Inconsistent models for relevant arithmetics
• On LP-models of arithmetic
• scientific article; zbMATH DE number 738893
• Consistency and decidability in some paraconsistent arithmetics

Cites work

• A semantical study of constructible falsity
• A theorem in 3-valued model theory with connections to number theory, type theory, and relevant logic
• Connexive modal logic
• Constructible falsity
• Constructible falsity and inexact predicates
• Dunn-Priest quotients of many-valued structures
• scientific article; zbMATH DE number 3139759 (Why is no real title available?)
• scientific article; zbMATH DE number 2070200 (Why is no real title available?)
• Inconsistent models for relevant arithmetics
• Inconsistent models of arithmetic. I: Finite models
• Kripke Completeness of First-Order Constructive Logics with Strong Negation
• Linear arithmetic desecsed
• Logics and falsifications. A new perspective on constructivist semantics
• Minimally inconsistent LP
• Negation as cancellation, and connexive logic

Cited in

(8)

• Inconsistent models of arithmetic. I: Finite models
• scientific article; zbMATH DE number 177636 (Why is no real title available?)
• Provability multilattice logic
• Executability and connexivity in an interpretation of Griss
• Paraconsistent models of Zermelo-Fraenkel set theory
• Connexive arithmetic formulated relevantly
• Possibilist models of executable arithmetic in an interpretation of Griss
• A model of connexive set theory

This page was built for publication: Inconsistent models (and infinite models) for arithmetics with constructible falsity

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