A decidable countably categorical model without nontrivial recursive automorphisms (Q1825864)
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: Publication:1825864 |
scientific article; zbMATH DE number 4121978
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A decidable countably categorical model without nontrivial recursive automorphisms |
scientific article; zbMATH DE number 4121978 |
Statements
A decidable countably categorical model without nontrivial recursive automorphisms (English)
0 references
1989
0 references
It is well known that every countably categorical model has continuum many automorphisms. In this paper it is shown that in constructive model theory this is not valid: there exists a countably categorical decidable model without nontrivial recursive automorphisms.
0 references
countably categorical model
0 references
constructive model theory
0 references
recursive automorphisms
0 references
0.8167309165000916
0 references
0.8006132245063782
0 references
0.7941024303436279
0 references
0.7915860414505005
0 references
0.7814703583717346
0 references
