Computable groups of automorphisms of models (Q1094411)
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 4025414
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computable groups of automorphisms of models |
scientific article; zbMATH DE number 4025414 |
Statements
Computable groups of automorphisms of models (English)
0 references
1986
0 references
The paper is concerned with computable groups. A criterion for the group of recursive automorphisms of a constructive (recursive) model to be computable is given. The author proves that the group of recursive automorphisms of a strongly constructive (decidable) model of an \(\omega\)-categorical theory is uncomputable if the theory has the property that its set of atomic formulae is recursive.
0 references
arithmetical hierarchy, recursive model
0 references
decidable model
0 references
computable groups
0 references
group of recursive automorphisms
0 references
0.94993913
0 references
0.92819977
0 references
0.9231049
0 references
0.9226674
0 references
0.91966265
0 references
0.9162187
0 references
