Limitwise monotonic sequences and degree spectra of structures

DOI10.1090/S0002-9939-2013-11586-8zbMath1408.03028OpenAlexW2085333977MaRDI QIDQ2845476

Bakhadyr Khoussainov, Alexander G. Melnikov, Iskander Sh. Kalimullin

Publication date: 30 August 2013

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0002-9939-2013-11586-8

Mathematics Subject Classification ID

Applications of computability and recursion theory (03D80) Computable structure theory, computable model theory (03C57) Abstract and axiomatic computability and recursion theory (03D75)

Related Items (21)

New degree spectra of Polish spaces ⋮ Limitwise monotonic reducibility on sets and on pairs of sets ⋮ A CHARACTERIZATION OF THE STRONGLY -REPRESENTABLE MANY-ONE DEGREES ⋮ Effectively categorical abelian groups ⋮ Computable completely decomposable groups ⋮ Iterated effective embeddings of abelian p-groups ⋮ Constructivizability of the Boolean algebra \( \mathfrak{B}( \omega ) \) with a distinguished automorphism ⋮ Rogers semilattices of limitwise monotonic numberings ⋮ Enumerating abelian \(p\)-groups ⋮ A Friedberg enumeration of equivalence structures ⋮ Some Questions in Computable Mathematics ⋮ THE COMPLEMENTS OF LOWER CONES OF DEGREES AND THE DEGREE SPECTRA OF STRUCTURES ⋮ Categoricity spectra for polymodal algebras ⋮ COMPUTABLE ABELIAN GROUPS ⋮ Computable topological groups and Pontryagin duality ⋮ Limitwise monotonic reducibility of sets and \(\Sigma\)-definability of abelian groups ⋮ Degree spectra of structures ⋮ Decomposability and computability ⋮ Limitwise monotonic sets of reals ⋮ On \(\Delta_2^0\)-categoricity of equivalence relations ⋮ Limitwise monotonic spectra and their generalizations

Cites Work

• Unnamed Item
• Unnamed Item
• Enumerations and completely decomposable torsion-free abelian groups
• Computable shuffle sums of ordinals
• On initial segments of computable linear orders
• Computable models of theories with few models
• Degree spectra and computable dimensions in algebraic structures
• Order-computable sets
• Effective categoricity of equivalence structures
• An uncountably categorical theory whose only computably presentable model is saturated
• Enumerations in computable structure theory
• Prime models of theories of computable linear orderings
• The -spectrum of a linear order
• Spectra of highn and non-lown degrees
• Degree spectra and immunity properties
• $\Sigma^0_1$ and $\Pi^0_1$ Equivalence Structures
• Relative to any nonrecursive set
• Enumerations, countable structures and Turing degrees
• LIMITWISE MONOTONIC FUNCTIONS AND THEIR APPLICATIONS
• Limitwise monotonic functions, sets, and degrees on computable domains
• Bounding prime models
• η-representation of sets and degrees
• On strongly minimal sets

This page was built for publication: Limitwise monotonic sequences and degree spectra of structures