scientific article; zbMATH DE number 1303201
From MaRDI portal
Publication:4249724
zbMath0941.03045MaRDI QIDQ4249724
Publication date: 31 July 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
surveypresentationscomputable orderingsinfinite injury priority methodcomputability theory of linear orderingseffective content of classical theorems
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Theory of numerations, effectively presented structures (03D45)
Related Items (43)
Degree spectra of relations on structures of finite computable dimension ⋮ \(\Pi_{1}^{0}\) classes and orderable groups ⋮ 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 completely decomposable groups ⋮ Torsion-free abelian groups with optimal Scott families ⋮ The uniform content of partial and linear orders ⋮ On a possible continuous analogue of the Szpilrajn theorem and its strengthening by Dushnik and Miller ⋮ Conditional extensions of fuzzy preorders ⋮ Linear orderings of low degree ⋮ A class of low linear orders having computable presentations ⋮ A Friedberg enumeration of equivalence structures ⋮ THE SIMPLEST LOW LINEAR ORDER WITH NO COMPUTABLE COPIES ⋮ Embeddings into left‐orderable simple groups ⋮ Primitive recursion and the chain antichain principle ⋮ Herrmann’s Beautiful Theorem on Computable Partial Orderings ⋮ The Kierstead's conjecture and limitwise monotonic functions ⋮ Computability-theoretic and proof-theoretic aspects of partial and linear orderings ⋮ A Note on Effective Categoricity for Linear Orderings ⋮ The Reverse Mathematics of wqos and bqos ⋮ Prime models of theories of computable linear orderings ⋮ Computable shuffle sums of ordinals ⋮ On a computable presentation of low linear orderings ⋮ Computability of distributive lattices ⋮ FINDING DESCENDING SEQUENCES THROUGH ILL-FOUNDED LINEAR ORDERS ⋮ Embedding jump upper semilattices into the Turing degrees ⋮ Algebraic structures computable without delay ⋮ Strongly \(\eta \)-representable degrees and limitwise monotonic functions ⋮ An undecidable linear order that is \(n\)-decidable for all \(n\) ⋮ Codings on linear orders and algorithmic independence of natural relations ⋮ Punctual dimension of algebraic structures in certain classes ⋮ Computable topological groups and Pontryagin duality ⋮ Categoricity spectra of computable structures ⋮ Computable linear orders and limitwise monotonic functions ⋮ Degree spectra of structures ⋮ A theorem on strongly \(\eta \)-representable sets ⋮ Categorical linearly ordered structures ⋮ On Kierstead’s conjecture ⋮ Increasing η -representable degrees ⋮ On self-embeddings of computable linear orderings ⋮ \(\Delta_{2}^{0}\)-categoricity in Boolean algebras and linear orderings
This page was built for publication:
