A decidable countably categorical model without nontrivial recursive automorphisms

DOI10.1007/BF00971394zbMATH Open0685.03027OpenAlexW2320324682MaRDI QIDQ1825864

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

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

Cites Work

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

Related Items (3)

Computably categorical structures and expansions by constants ⋮ Automorphism groups of decidable models ⋮ Recursive categoricity and persistence

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)