scientific article; zbMATH DE number 1303201
The aim of the paper under review is to give a survey of results and techniques in the computability theory of linear orderings. In particular the following topics are included and discussed: the analysis of the notion of presentation of a structure (ordering), how computable properties may partition classical isomorphism types of computable orderings, the infinite injury priority method and the fundamental results of Watnick and Lerman, the effective content of various classical theorems, concentrating on embeddings and automorphisms, linear extensions of computable partial orderings, degree-theoretical aspects of presentations. In the final section other areas of computable combinatorics and other areas of computable aspects of linear orderings are briefly discussed. The paper contains also some new results, unpublished results and new proofs of old results, as well as numerous open questions. For the entire collection see [Zbl 0905.03002].
- Computability-theoretic and proof-theoretic aspects of partial and linear orderings
- Computable linearizations of well-partial-orderings
- Computability on linear orderings enriched with predicates
- Computable linear orders and the Ershov hierarchy
- Computable linear orders and the ershov hierarchy
- COMPUTABLE LINEAR ORDERS AND PRODUCTS
- Computable choice functions for computable linear orderings
- Order-computable sets
- Computable presentability of countable linear orders
- On self-embeddings of computable linear orderings
- Computability-theoretic and proof-theoretic aspects of partial and linear orderings
- Degree spectra of relations on structures of finite computable dimension
- \(\Pi_{1}^{0}\) classes and orderable groups
- Conditional extensions of fuzzy preorders
- The Kierstead's conjecture and limitwise monotonic functions
- Computability of distributive lattices
- \(\Delta_{2}^{0}\)-categoricity in Boolean algebras and linear orderings
- Punctual dimension of algebraic structures in certain classes
- Categoricity spectra of computable structures
- Computable linear orders and limitwise monotonic functions
- Degree spectra of structures
- Computable presentability of countable linear orders
- Codings on linear orders and algorithmic independence of natural relations
- Categorical linearly ordered structures
- Sufficient conditions for the existence of 0'-limitwise monotonic functions for computable \(\eta\)-like linear orders
- Degrees of autostability for linear orders and linearly ordered abelian groups
- Equivalence between Fraïssé's conjecture and Jullien's theorem
- Effectively categorical abelian groups
- Computable linearizations of well-partial-orderings
- The uniform content of partial and linear orders
- On self-embeddings of computable linear orderings
- Prime models of theories of computable linear orderings
- Weak presentations of computable partial orderings
- Herrmann’s Beautiful Theorem on Computable Partial Orderings
- A note on effective categoricity for linear orderings
- Computable completely decomposable groups
- The computability path ordering
- scientific article; zbMATH DE number 3882490 (Why is no real title available?)
- The reverse mathematics of wqos and bqos
- Increasing η -representable degrees
- On computable self-embeddings of computable linear orderings
- scientific article; zbMATH DE number 1048041 (Why is no real title available?)
- Primitive recursion and the chain antichain principle
- scientific article; zbMATH DE number 1531924 (Why is no real title available?)
- Torsion-free abelian groups with optimal Scott families
- A Friedberg enumeration of equivalence structures
- Embedding jump upper semilattices into the Turing degrees
- Computable topological groups and Pontryagin duality
- COMPUTABLE LINEAR ORDERS AND PRODUCTS
- CODING IN GRAPHS AND LINEAR ORDERINGS
- FINDING DESCENDING SEQUENCES THROUGH ILL-FOUNDED LINEAR ORDERS
- On Kierstead’s conjecture
- Algebraic structures computable without delay
- An undecidable linear order that is n-decidable for all n
- A class of low linear orders having computable presentations
- Linear orderings of low degree
- THE SIMPLEST LOW LINEAR ORDER WITH NO COMPUTABLE COPIES
- Embeddings into left‐orderable simple groups
- On a computable presentation of low linear orderings
- Low scattered linear orders
- Strongly -representable degrees and limitwise monotonic functions
- Indivisibility and uniform computational strength
- Generically computable linear orderings
- On categoricity of scattered linear orders of constructive ranks
- Weihrauch complexity for elementary embeddings into countable saturated models
- A low scattered linear order of rank 2 without computable copy
- Well quasi-orders, better quasi-orders, and monomial ideals
- A theorem on strongly \(\eta \)-representable sets
- On a possible continuous analogue of the Szpilrajn theorem and its strengthening by Dushnik and Miller
- Computable shuffle sums of ordinals
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4249724)
