A decidable countably categorical model without nontrivial recursive automorphisms

DOI10.1007/BF00971394MaRDI QIDQ1825864zbMATH OpenOpenAlexFDO

Authors Andrei S. Morozov

Publication date 1989

Published in Siberian Mathematical Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00971394

zbMATH Keywords

recursive automorphismsconstructive model theorycountably categorical model

Mathematics Subject Classification ID

Categoricity and completeness of theories (03C35) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Recommendations

• Automorphism groups of decidable models
• Constructive models of uncountably categorical theories
• Countably categorical theories
• On autostability of almost prime models relative to strong constructivizations
• Computable groups of automorphisms of models

Cited in

(4)

• Automorphism groups of decidable models
• Recursive categoricity and persistence
• scientific article; zbMATH DE number 4016877 (Why is no real title available?)
• Computably categorical structures and expansions by constants

This page was built for publication: A decidable countably categorical model without nontrivial recursive automorphisms

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