A decidable countably categorical model without nontrivial recursive automorphisms

DOI10.1007/BF00971394zbMATH Open0685.03027OpenAlexW2320324682MaRDI QIDQ1825864FDOQ1825864

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

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (4)

• Recursive categoricity and persistence
• Automorphism groups of decidable models
• Title not available (Why is that?)
• 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)