scientific article; zbMATH DE number 1303201
From MaRDI portal
Publication:4249724
Recommendations
- 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
Cited in
(51)- An undecidable linear order that is \(n\)-decidable for all \(n\)
- Computable completely decomposable groups
- The Kierstead's conjecture and limitwise monotonic functions
- On computable self-embeddings of computable linear orderings
- The computability path ordering
- Strongly -representable degrees and limitwise monotonic functions
- A theorem on strongly \(\eta \)-representable sets
- On a possible continuous analogue of the Szpilrajn theorem and its strengthening by Dushnik and Miller
- The uniform content of partial and linear orders
- Embeddings into left‐orderable simple groups
- \(\Pi_{1}^{0}\) classes and orderable groups
- Codings on linear orders and algorithmic independence of natural relations
- scientific article; zbMATH DE number 3882490 (Why is no real title available?)
- Categoricity spectra of computable structures
- Degrees of autostability for linear orders and linearly ordered abelian groups
- A note on effective categoricity for linear orderings
- Prime models of theories of computable linear orderings
- FINDING DESCENDING SEQUENCES THROUGH ILL-FOUNDED LINEAR ORDERS
- Computable topological groups and Pontryagin duality
- Punctual dimension of algebraic structures in certain classes
- Linear orderings of low degree
- Computable linear orders and limitwise monotonic functions
- Categorical linearly ordered structures
- Degree spectra of relations on structures of finite computable dimension
- A class of low linear orders having computable presentations
- Computability-theoretic and proof-theoretic aspects of partial and linear orderings
- Equivalence between Fraïssé's conjecture and Jullien's theorem
- On Kierstead’s conjecture
- Increasing η -representable degrees
- On self-embeddings of computable linear orderings
- Herrmann’s Beautiful Theorem on Computable Partial Orderings
- Conditional extensions of fuzzy preorders
- Computability of distributive lattices
- \(\Delta_{2}^{0}\)-categoricity in Boolean algebras and linear orderings
- Embedding jump upper semilattices into the Turing degrees
- CODING IN GRAPHS AND LINEAR ORDERINGS
- Torsion-free abelian groups with optimal Scott families
- COMPUTABLE LINEAR ORDERS AND PRODUCTS
- Degree spectra of structures
- Sufficient conditions for the existence of 0'-limitwise monotonic functions for computable \(\eta\)-like linear orders
- Primitive recursion and the chain antichain principle
- Effectively categorical abelian groups
- scientific article; zbMATH DE number 1531924 (Why is no real title available?)
- Computable linearizations of well-partial-orderings
- On a computable presentation of low linear orderings
- Weak presentations of computable partial orderings
- The reverse mathematics of wqos and bqos
- THE SIMPLEST LOW LINEAR ORDER WITH NO COMPUTABLE COPIES
- A Friedberg enumeration of equivalence structures
- Computable shuffle sums of ordinals
- Algebraic structures computable without delay
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)
