Is there an inconsistent primitive recursive relation?

DOI10.1007/S11229-022-03900-XMaRDI QIDQ6836569zbMATH OpenFDO

Authors Seungrak Choi

Publication date 27 March 2026

Published in Synthese (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S11229-022-03900-X

zbMATH Keywords

dialetheismGödel's incompleteness theoremGraham Priestinconsistent arithmeticprimitive recursive relation

Mathematics Subject Classification ID

Philosophical and critical aspects of logic and foundations (03A05) Recursive functions and relations, subrecursive hierarchies (03D20) First-order arithmetic and fragments (03F30) Gödel numberings and issues of incompleteness (03F40)

Cites work

• A note on Priest's finite inconsistent arithmetics
• AXIOMS FOR FINITE COLLAPSE MODELS OF ARITHMETIC
• Consistency and decidability in some paraconsistent arithmetics
• Doubt truth to be a liar
• scientific article; zbMATH DE number 3131080 (Why is no real title available?)
• Inconsistency and Incompleteness, Revisited
• Inconsistent models of arithmetic. I: Finite models
• Inconsistent models of arithmetic. II: The general case
• Minimally inconsistent LP
• On LP-models of arithmetic
• Paraconsistent computation and dialetheic machines
• Saving Proof from Paradox: Gödel’s Paradox and the Inconsistency of Informal Mathematics
• Set Theory
• The logic of paradox

Cited in

(2)

• Changing the logic without changing the subject: the case of computability
• A note on the strength of paraconsistent arithmetic

This page was built for publication: Is there an inconsistent primitive recursive relation?

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