Some Questions in Computable Mathematics
From MaRDI portal
Publication:2973717
DOI10.1007/978-3-319-50062-1_4zbMath1480.03006OpenAlexW2559666299MaRDI QIDQ2973717
Publication date: 4 April 2017
Published in: Computability and Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-50062-1_4
Foundations of classical theories (including reverse mathematics) (03B30) Computable structure theory, computable model theory (03C57) Computability and recursion theory (03Dxx)
Related Items (6)
Generic complexity of the membership problem for semigroups of integer matrices ⋮ The reverse mathematics of non-decreasing subsequences ⋮ A MINIMAL PAIR IN THE GENERIC DEGREES ⋮ Generic complexity of the word problem in some semigroups ⋮ The gamma question for many-one degrees ⋮ PUNCTUAL CATEGORICITY AND UNIVERSALITY
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Coherent randomness tests and computing the \(K\)-trivial sets
- A separation of two randomness concepts
- The weakness of being cohesive, thin or free in reverse mathematics
- The inductive strength of Ramsey's theorem for pairs
- Enumerations and completely decomposable torsion-free abelian groups
- Degrees of orderings not isomorphic to recursive linear orderings
- Comparing notions of randomness
- Randomness and the linear degrees of computability
- Autostability of models
- Problem of the number of non-self-equivalent constructivizations
- Approximations to the halting problem
- Mathematical metaphysics of randomness
- Recursive and r.e. quotient Boolean algebras
- Generic-case complexity, decision problems in group theory, and random walks.
- Computability-theoretic and proof-theoretic aspects of partial and linear orderings
- Degree spectra and computable dimensions in algebraic structures
- Constructive models of complete solvable theories
- Randomness and reducibility
- On the strength of Ramsey's theorem
- Equivalence between Fraïssé's conjecture and Jullien's theorem
- Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)
- On self-embeddings of computable linear orderings
- Kolmogorov-Loveland randomness and stochasticity
- Computable Boolean algebras
- On the strength of Ramsey's theorem for pairs
- The -spectrum of a linear order
- A Δ20 set with no infinite low subset in either it or its complement
- Randomness, Computability, and Density
- THE GENERIC DEGREES OF DENSITY-1 SETS, AND A CHARACTERIZATION OF THE HYPERARITHMETIC REALS
- On uniform relationships between combinatorial problems
- Asymptotic density and the coarse computability bound
- Limitwise monotonic sequences and degree spectra of structures
- Generic computability, Turing degrees, and asymptotic density
- RT22 does not imply WKL0
- Spectra of highn and non-lown degrees
- Ramsey’s theorem for singletons and strong computable reducibility
- STRONG REDUCTIONS BETWEEN COMBINATORIAL PRINCIPLES
- COARSE REDUCIBILITY AND ALGORITHMIC RANDOMNESS
- Kolmogorov complexity and the Recursion Theorem
- ON THE COMPLEXITY OF THE SUCCESSIVITY RELATION IN COMPUTABLE LINEAR ORDERINGS
- Algorithmic Randomness and Complexity
- Asymptotic density, computable traceability, and 1-randomness
- On notions of computability-theoretic reduction between Π21 principles
- The metamathematics of Stable Ramsey’s Theorem for Pairs
- Slicing the Truth
- Partition Theorems and Computability Theory
- Computable categoricity of trees of finite height
- Computable trees, prime models, and relative decidability
- Randomness and Computability: Open Questions
- Calibrating Randomness
- Random reals and Lipschitz continuity
- Combinatorial principles weaker than Ramsey's Theorem for pairs
- Counting the changes of random Δ20 sets
- The Strength of Some Combinatorial Principles Related to Ramsey's Theorem for Pairs
- d-computable categoricity for algebraic fields
- On computable self-embeddings of computable linear orderings
- Omitting types, type spectrums, and decidability
- Every sequence is reducible to a random one
- Degrees coded in jumps of orderings
- Foundations of recursive model theory
- Recursively Categorical Linear Orderings
- Recursively presentable prime models
- Hyperarithmetically Encodable Sets
- Every Low Boolean Algebra is Isomorphic to a Recursive One
- Relative to any nonrecursive set
- Enumerations, countable structures and Turing degrees
- Effective prime uniqueness
- A Unifying Approach to the Gamma Question
- A COMPUTABLE FUNCTOR FROM GRAPHS TO FIELDS
- The Kolmogorov-Loveland stochastic sequences are not closed under selecting subsequences
- Degrees of Structures
- Categoricity properties for computable algebraic fields
- Asymptotic density and the Ershov hierarchy
- Nonexistence of minimal pairs for generic computability
- Using random sets as oracles
- Degree spectra of prime models
- On the construction of effectively random sets
- OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS
- DENSITY-1-BOUNDING AND QUASIMINIMALITY IN THE GENERIC DEGREES
- ASYMPTOTIC DENSITY AND COMPUTABLY ENUMERABLE SETS
- Cone avoiding closed sets
- A unified approach to the definition of random sequences
- Ramsey's theorem and recursion theory
- COMPUTABLE FUNCTORS AND EFFECTIVE INTERPRETABILITY
- Concerning similarity transformations of linearly ordered sets
This page was built for publication: Some Questions in Computable Mathematics
