Examples of nonautostable systems (Q1077409): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / author | |||
Property / author: Q282112 / rank | |||
Property / author | |||
Property / author: Andrey Novikov / rank | |||
Property / reviewed by | |||
Property / reviewed by: Roman Kossak / rank | |||
Property / author | |||
Property / author: Sergei S. Goncharov / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Andrey Novikov / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Roman Kossak / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Autostability of models / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5573961 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5609457 / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf00968890 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2059527261 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 11:13, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Examples of nonautostable systems |
scientific article |
Statements
Examples of nonautostable systems (English)
0 references
1984
0 references
An enumeration \(\nu\) : \(N\to {\mathfrak A}\) is called a constructivization of a countable model \({\mathfrak A}\) if (roughly speaking) the relations and functions of the presentation of \({\mathfrak A}\) on N given by \(\nu\) are recursive. Constructivizations \(\nu\) and \(\mu\) are autoequivalent if there is an automorphism \(\phi\) of \({\mathfrak A}\) and a recursive function f such that \(\phi \nu =\mu f\). Model \({\mathfrak A}\) is called autostable if any two constructivizations of \({\mathfrak A}\) are autoequivalent. The algorithmic dimension of a model \({\mathfrak A}\), \(\dim_ A{\mathfrak A}\), is the maximal number of nonautoequivalent constructivizations of \({\mathfrak A}\). Among the results on algorithmic dimensions and possible numbers of autoequivalent constructivizations, which are not recursively equivalent, we have the following: there are models \({\mathfrak A}\) and \({\mathfrak B}\) such that \(\dim_ A{\mathfrak A}=1\) and \(\dim_ A{\mathfrak A}^ 2\geq 2\), \(\dim_ A{\mathfrak B}=\aleph_ 0\) and \(\dim_ A{\mathfrak B}^ 2=1\). Examples are given to show that the class of autostable models is not closed under finitely generated extensions. The paper is concluded with remarks concerning autostability of periodic groups.
0 references
autoequivalence
0 references
constructivization
0 references
algorithmic dimension of a model
0 references
autostable models
0 references
autostability of periodic groups
0 references