Inconsistent models of arithmetic. II: The general case
This paper extends the results of Part I [``Inconsistent models of arithmetic. I: Finite models, J. Philos. Log. 26, 223-235 (1997; Zbl 0878.03017)], to include non-finite cases. Inconsistent models of arithmetic are interpretations of the language of (first-order) arithmetic which model all the truths of the standard model of arithmetic plus more, and which are thereby inconsistent. The models can be chunked into objects called nuclei, and fall into three classes, (i) those with improper nuclei, (ii) those with proper nuclei and linear tails, and (iii) those with proper nuclei and cyclical tails. Improper nuclei may have the order-type of any ordinal and the order-type need not be discrete. The paper concludes with some open questions about inconsistent models of arithmetic.
- Inconsistent models of arithmetic. I: Finite models
- The scope of Gödel's first incompleteness theorem
- Inconsistency in mathematics and the mathematics of inconsistency
- A note on Priest's finite inconsistent arithmetics
- Transfinite cardinals in paraconsistent set theory
- Illusory models of Peano arithmetic
- AXIOMS FOR FINITE COLLAPSE MODELS OF ARITHMETIC
- Variations on the collapsing lemma
- scientific article; zbMATH DE number 3841857 (Why is no real title available?)
- Disturbing arithmetic
- Inconsistent models for relevant arithmetics
- Inconsistent nonstandard arithmetic
- scientific article; zbMATH DE number 4125377 (Why is no real title available?)
- Notes on the model theory of DeMorgan logics
- 2003 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquim '03
- New arguments for adaptive logics as unifying frame for the defeasible handling of inconsistency
- Inconsistent Models for Relevant Arithmetics
- Some Lessons Learned About Adding Conditionals to Certain Many-Valued Logics
- On elimination of quantifiers in some non-classical mathematical theories
- On LP-models of arithmetic
- Is there an inconsistent primitive recursive relation?
- On a first-order bi-sorted semantically closed language
- Contingent abstract objects
- Possibilist models of executable arithmetic in an interpretation of Griss
This page was built for publication: Inconsistent models of arithmetic. II: The general case
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2710594)