The intrinsic enumerability of linear orders

zbMATH Open0965.03049MaRDI QIDQ2714036FDOQ2714036

Authors: A. N. Khisamiev 

Publication date: 10 June 2001

Published in: Algebra i Logika (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/187956

Recommendations

• Relations Intrinsically Recursive in Linear Orders
• The Complexity of intrinsically r.e. subsets of existentially decidable models
• scientific article; zbMATH DE number 1534570
• Numberings and definability in the hereditarily finite superstructure of a model
• scientific article; zbMATH DE number 1191236

zbMATH Keywords

admissible sethereditarily finite superstructureintrinsically enumerable model

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Cited In (4)

• A note on the expressive power of linear orders
• Countable homogeneous linearly ordered posets
• Countable linear orders with disjoint infinite intervals are mutually orthogonal
• A coding of the countable linear orderings

This page was built for publication: The intrinsic enumerability of linear orders

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