Limitwise monotonic sequences and degree spectra of structures

DOI10.1090/S0002-9939-2013-11586-8zbMath1408.03028MaRDI 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

03D80: Applications of computability and recursion theory

03C57: Computable structure theory, computable model theory

03D75: Abstract and axiomatic computability and recursion theory

Related Items

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

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