The intrinsic enumerability of linear orders

MaRDI QIDQ2714036zbMATH OpenFDO

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

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)

Review text

A model \(M\) is called intrinsically enumerable if there exists a mapping \(\nu\:\omega\rightarrow {\mathfrak M}\) which is \(\Sigma\)-definable over \(\mathbb {HF}({\mathfrak M})\). The main result asserts that every infinite linear ordering is not intrinsically enumerable. Some criteria are proven for the existential equivalence and inclusions between existential theories of models of the kind \(\langle{\mathbb {HF}}({\mathfrak M}),a\rangle\).

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

Cited in

(4)

• Countable linear orders with disjoint infinite intervals are mutually orthogonal
• A note on the expressive power of linear orders
• Countable homogeneous linearly ordered posets
• 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)