When is arithmetic possible? (Q922533): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 18:24, 30 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | When is arithmetic possible? |
scientific article |
Statements
When is arithmetic possible? (English)
0 references
1990
0 references
When a structure or class of structures admits an unbounded induction, arithmetic can be done on the stages of that induction; if only bounded inductions are admitted, then every inductively definable relation can be defined by a finite explicit expression. This article presents evidence that the converse is true, and investigates a combinatorial property equivalent to ``all \(L^{<\omega}_{\infty \omega}\)-definable relations are elementary''.
0 references
expressibility
0 references
parametrization
0 references
bounded inductions
0 references