Recursively saturated models generated by indiscernibles (Q1165236)
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 3765764
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Recursively saturated models generated by indiscernibles |
scientific article; zbMATH DE number 3765764 |
Statements
Recursively saturated models generated by indiscernibles (English)
0 references
1985
0 references
countable recursively saturated model of Peano arithmetic
0 references
