No label defined (Q4463935)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2070199
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 2070199 |
Statements
8 June 2004
0 references
paraconsistency
0 references
finite arithmetics
0 references
proof
0 references
inconsistent models of arithmetic
0 references
0.8917859
0 references
0.8917859
0 references
0 references
0 references
0.87889665
0 references
0 references
This paper summarises technical results about natural number arithmetics built on inconsistent but nontrivial logics. Dunn's Collapsing Lemma provides that if an interpretation is a model of some set of sentences, then any interpretation obtained by identifying all members of an equivalence class to produce a composite individual which has all the properties (even inconsistent ones) of all of its members will also be a model of that set. Inconsistent models of arithmetic, unlike other nonstandard models of it, may be finite. This section of the paper concludes with a number of open problems about inconsistent models of arithmetic, notably whether every such model can be obtained by Collapse. In the philosophical section, Priest points out that while Tarski showed that any theory which contains its own truth predicate is inconsistent, this does not debar an inconsistent arithmetic from doing so. He then considers the Gödel results, argues that the naive notion of proof is itself inconsistent, and discusses criticisms made by \textit{S. Shapiro} [``Incompleteness and inconsistency'', Mind 111, 817--832 (2002)], emphasising that if we are to have inconsistent arithmetic we cannot retain a consistent theory of computation or a consistent metamathematics of proof. For the entire collection see [Zbl 1029.00014].
0 references