Finitary consistency of a free arithmetic (Q797576)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Finitary consistency of a free arithmetic |
scientific article; zbMATH DE number 3867320
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finitary consistency of a free arithmetic |
scientific article; zbMATH DE number 3867320 |
Statements
Finitary consistency of a free arithmetic (English)
0 references
1984
0 references
A free variant FA of Peano arithmetic is proved consistent by using finite (outer domain) models. FA is weaker than standard arithmetic in two senses. First, one cannot prove that the successor, addition, and multiplication functions are always defined. Second, one cannot prove \(\sim s(t)=0.\) However, one can prove both of the above for closed terms.
0 references
finitary consistency
0 references
free arithmetic
0 references
0.761273205280304
0 references
0.7476404905319214
0 references
0.7405657172203064
0 references
