Computable shuffle sums of ordinals

DOI10.1007/s00153-008-0077-3zbMath1149.03034OpenAlexW1971838439MaRDI QIDQ938232

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)

Related Items (8)

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

Cites Work

• Unnamed Item
• On initial segments of computable linear orders
• Computable models of theories with few models
• Effective categoricity of equivalence structures
• Prime models of theories of computable linear orderings
• Jumps of Orderings

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