Computable linear orders and limitwise monotonic functions

DOI10.1007/S10958-021-05421-3MaRDI QIDQ2036468zbMATH OpenOpenAlexFDO

Publication date 29 June 2021

Published in Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10958-021-05421-3

automorphism computable linear order effective presentation limitwise monotonic function low degree self-embedding

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Recommendations

Limitwise monotonic functions relative to the Kleene's ordinal notation system
LIMITWISE MONOTONIC FUNCTIONS AND THEIR APPLICATIONS
Sufficient conditions for the existence of 0'-limitwise monotonic functions for computable \(\eta\)-like linear orders
On limitwise monotonicity and maximal block functions
Limitwise monotonic functions, sets, and degrees on computable domains

Cites work

η-representation of sets and degrees
Automorphisms of -like computable linear orderings and Kierstead's conjecture
Computability on linear orderings enriched with predicates
Computable shuffle sums of ordinals
Corrigendum: "On the complexity of the successivity relation in computable linear orderings"
Cuts of linear orders
Degree spectra of relations on computable structures in the presence of Δ₂⁰isomorphisms
Degree spectra of the successor relation of computable linear orderings
Degrees of orderings not isomorphic to recursive linear orderings
Every Low Boolean Algebra is Isomorphic to a Recursive One
Hierarchies of Boolean algebras
scientific article; zbMATH DE number 3882490 (Why is no real title available?)
scientific article; zbMATH DE number 3715794 (Why is no real title available?)
scientific article; zbMATH DE number 3732037 (Why is no real title available?)
scientific article; zbMATH DE number 3767656 (Why is no real title available?)
scientific article; zbMATH DE number 194103 (Why is no real title available?)
scientific article; zbMATH DE number 1303201 (Why is no real title available?)
scientific article; zbMATH DE number 1303204 (Why is no real title available?)
scientific article; zbMATH DE number 3805534 (Why is no real title available?)
scientific article; zbMATH DE number 3291134 (Why is no real title available?)
Increasing η -representable degrees
Initial segments of computable linear orders with additional computable predicates
LIMITWISE MONOTONIC FUNCTIONS AND THEIR APPLICATIONS
Limitwise monotonic functions relative to the Kleene's ordinal notation system
Limitwise monotonic functions, sets, and degrees on computable domains
Linear orderings of low degree
Low linear orderings
On Π₁-automorphisms of recursive linear orders
On Choice Sets and Strongly Non-Trivial Self-Embeddings of Recursive Linear Orders
On computable self-embeddings of computable linear orderings
On initial segments of computable linear orders
On Kierstead’s conjecture
On notation for ordinal numbers
On the complexity of the successivity relation in computable linear orderings
Partially Ordered Sets
Recursive automorphisms of recursive linear orderings
Recursive Linear Orders with Incomplete Successivities
Scattered linear orderings with no computable presentation
Strongly -representable degrees and limitwise monotonic functions
Sufficient conditions for the existence of 0'-limitwise monotonic functions for computable \(\eta\)-like linear orders
The block relation in computable linear orders
The constructive second number class
The Kierstead's conjecture and limitwise monotonic functions
Δ 2 0 -copies of linear orderings

Cited in

(4)

Computable presentability of countable linear orders
COMPUTABLE LINEAR ORDERS AND PRODUCTS
Rogers semilattices of limitwise monotonic numberings
A low scattered linear order of rank 2 without computable copy

This page was built for publication: Computable linear orders and limitwise monotonic functions

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