Access the full text.
Sign up today, get DeepDyve free for 14 days.
(1980)
The problem of the number of nonautoequivalent constructivizations. Algebra i Logika
(1987)
Remmel . Recursively rigid Boolean algebras
(1181)
Gainesville, FL 32611 URL: www.math.ufl.edu/∼cenzer E-mail address: cenzer@math.ufl.edu Department of Pure Mathematics
S. Goncharov, V. Dzgoev (1980)
Autostability of modelsAlgebra and Logic, 19
Yuri Ventsov (1986)
Algorithmic properties of branching modelsAlgebra and Logic, 25
(1980)
The problem of the number of nonautoequivalent constructivizations
(1980)
Gončarov. Autostability of models
B. Khusainov (1988)
Algorithmic degree of unarsAlgebra and Logic, 27
(1986)
Algorithmic properties of branching models. Algebra i Logika
(1981)
Remmel . Recursively categorical linear orderings
(1988)
The algorithmic dimension of unars
S. Goncharov (1980)
Problem of the number of non-self-equivalent constructivizationsAlgebra and Logic, 19
J. Remmel (1987)
Recursively rigid Boolean algebrasAnn. Pure Appl. Log., 36
(1980)
Autostability of models. Algebra i Logika
(1980)
Gončarov. The problem of the number of nonautoequivalent constructivizations
(1988)
The algorithmic dimension of unars. Algebra i Logika
Peter Cholak, S. Goncharov, B. Khoussainov, R. Shore (1999)
Computably categorical structures and expansions by constantsJournal of Symbolic Logic, 64
J. Remmel (1981)
Recursively categorical linear orderings, 83
W. Calvert, D. Cenzer, V. Harizanov, A. Morozov (2006)
Effective categoricity of equivalence structuresAnn. Pure Appl. Log., 141
We consider certain linear orders with a function on them, and discuss for which types of functions the resulting structure is or is not computably categorical. Particularly, we consider computable copies of the rationals with a fixed-point free automorphism, and also ω with a non-decreasing function.
Archive for Mathematical Logic – Springer Journals
Published: Dec 20, 2008
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.