Predicative foundations of arithmetic (Q1344849)
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 724110
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Predicative foundations of arithmetic |
scientific article; zbMATH DE number 724110 |
Statements
Predicative foundations of arithmetic (English)
0 references
22 February 1995
0 references
The aim of the paper is to show that a predicatively acceptable axiomatization of the natural number system can be formulated and that the existence of the appropriate structures as well as the categoricity of the axioms can be proved in a predicatively acceptable way. A three- sorted system EFSC (elementary theory of finite sets and classes) and an extension of EFSC are constructed and studied. It is shown that EFSC contains Peano arithmetic PA and is a conservative extension of PA.
0 references
elementary theory of finite sets and classes
0 references
predicatively acceptable axiomatization of the natural number system
0 references
Peano arithmetic
0 references
0.8506259918212891
0 references
0.8506259322166443
0 references
0.7586037516593933
0 references
0.7586037516593933
0 references
