Prime models of theories of computable linear orderings

DOI10.1090/S0002-9939-01-05923-8zbMath0974.03040OpenAlexW1599486919MaRDI QIDQ2723507

Denis R. Hirschfeldt

Publication date: 5 July 2001

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0002-9939-01-05923-8

zbMATH Keywords

computable modelprime modelcomplete theory of linear orderings

Mathematics Subject Classification ID

Total orders (06A05) Models with special properties (saturated, rigid, etc.) (03C50) Models of other mathematical theories (03C65) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Related Items (5)

Bounding prime models ⋮ On limitwise monotonicity and maximal block functions ⋮ Iterated effective embeddings of abelian p-groups ⋮ Computable shuffle sums of ordinals ⋮ Limitwise monotonic sequences and degree spectra of structures

Cites Work

• Theory of Abelian groups with constructive models
• On initial segments of computable linear orders
• Computable models of theories with few models
• Jumps of Orderings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Prime models of theories of computable linear orderings