Consistency and decidability in some paraconsistent arithmetics

DOI10.26686/AJL.V18I5.6921MaRDI QIDQ5019131zbMATH OpenOpenAlexFDO

Authors Andrew Tedder

Publication date 29 December 2021

Published in The Australasian Journal of Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.26686/ajl.v18i5.6921

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Recommendations

• On paraconsistent downward Löwenheim-Skolem theorems
• scientific article; zbMATH DE number 2070199
• Inconsistent models for relevant arithmetics
• scientific article; zbMATH DE number 4083589
• scientific article; zbMATH DE number 1874096

Cited in

(11)

• Paraconsistent metatheory: new proofs with old tools
• Towards an arithmetic theory of consistency enforcement based on preservation of -constraints
• Paraconsistent arithmetic with a local consistency operator and global selfreference
• Inconsistent models (and infinite models) for arithmetics with constructible falsity
• Decidability and Specker sequences in intuitionistic mathematics
• Inconsistent nonstandard arithmetic
• scientific article; zbMATH DE number 1874096 (Why is no real title available?)
• On paraconsistent downward Löwenheim-Skolem theorems
• Is there an inconsistent primitive recursive relation?
• Limits for paraconsistent calculi
• A note on the strength of paraconsistent arithmetic

This page was built for publication: Consistency and decidability in some paraconsistent arithmetics

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