On automorphic tuples of elements in computable models

MaRDI QIDQ3068266zbMATH OpenFDO

Authors A. V. Romina, S. S. Goncharov, Valentina Harizanov, J. F. Knight, Andrei S. Morozov

Publication date 13 January 2011

Full work available at URL http://www.emis.de/journals/SMZ/2005/03/523.htm

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

admissible setautomorphic tuplescomputabilitycomputable modelconstructive modelhyperarithmetical modelquantifier rankrecursive automorphismrecursive modelScott rank

Mathematics Subject Classification ID

Categoricity and completeness of theories (03C35) Computable structure theory, computable model theory (03C57)

Recommendations

• Computable groups of automorphisms of models
• Criteria of autostability for 1-decidable models
• Some properties of autostable models
• scientific article; zbMATH DE number 4077177
• On autostability of almost prime models relative to strong constructivizations

Cited in

(5)

• Computable groups of automorphisms of models
• On the isomorphism problem for some classes of computable algebraic structures
• Turing degrees and automorphism groups of substructure lattices
• Automorphism Groups of Substructure Lattices of Vector Spaces in Computable Algebra
• A robuster Scott rank

This page was built for publication: On automorphic tuples of elements in computable models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3068266)