Computable shuffle sums of ordinals

DOI10.1007/S00153-008-0077-3MaRDI QIDQ938232zbMATH OpenOpenAlexFDO

Authors Asher M. Kach

Publication date 18 August 2008

Published in Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00153-008-0077-3

zbMATH Keywords

computable orderingslimit infimum functionslimitwise monotonic functionsshuffle sums

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45)

Recommendations

• Sums of computable ordinals
• Shuffling of Linear Orders
• Limitwise monotonic sets of reals
• Order-computable sets
• Sums of finitely many ordinals of various kinds

Cites work

• scientific article; zbMATH DE number 1303201 (Why is no real title available?)
• Computable models of theories with few models
• Effective categoricity of equivalence structures
• Jumps of Orderings
• On initial segments of computable linear orders
• Prime models of theories of computable linear orderings

Cited in

(9)

• Limitwise monotonic functions, sets, and degrees on computable domains
• Iterated effective embeddings of abelian \(p\)-groups
• Constructivizability of the Boolean algebra \( \mathfrak{B}( \omega ) \) with a distinguished automorphism
• Computable linear orders and limitwise monotonic functions
• On limitwise monotonicity and maximal block functions
• Limitwise monotonic sequences and degree spectra of structures
• Sums of computable ordinals
• On a computable presentation of low linear orderings
• Automorphisms of \(\eta\)-like computable linear orderings and Kierstead's conjecture

This page was built for publication: Computable shuffle sums of ordinals

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