Some Questions in Computable Mathematics (Q2973717)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Some Questions in Computable Mathematics	scientific article

Statements

scholarly article

0 references

Some Questions in Computable Mathematics (English)

0 references

zbMATH Open document ID

0 references

10.1007/978-3-319-50062-1_4

0 references

Denis R. Hirschfeldt

0 references

Computability and Complexity

0 references

publication date

4 April 2017

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-319-50062-1_4

0 references

0 references

Asymptotic density, computable traceability, and 1-randomness

0 references

Coherent randomness tests and computing the \(K\)-trivial sets

0 references

0 references

Effective prime uniqueness

0 references

DENSITY-1-BOUNDING AND QUASIMINIMALITY IN THE GENERIC DEGREES

0 references

On the strength of Ramsey's theorem for pairs

0 references

The metamathematics of Stable Ramsey’s Theorem for Pairs

0 references

The inductive strength of Ramsey's theorem for pairs

0 references

Degree spectra of prime models

0 references

On uniform relationships between combinatorial problems

0 references

0 references

0 references

Algorithmic Randomness and Complexity

0 references

Randomness and reducibility

0 references

A Δ<sub>2</sub><sup>0</sup> set with no infinite low subset in either it or its complement

0 references

Computability-theoretic and proof-theoretic aspects of partial and linear orderings

0 references

Randomness, Computability, and Density

0 references

Calibrating Randomness

0 references

Every Low Boolean Algebra is Isomorphic to a Recursive One

0 references

Asymptotic density and the Ershov hierarchy

0 references

On self-embeddings of computable linear orderings

0 references

ASYMPTOTIC DENSITY AND COMPUTABLY ENUMERABLE SETS

0 references

On computable self-embeddings of computable linear orderings

0 references

0 references

ON THE COMPLEXITY OF THE SUCCESSIVITY RELATION IN COMPUTABLE LINEAR ORDERINGS

0 references

0 references

Concerning similarity transformations of linearly ordered sets

0 references

STRONG REDUCTIONS BETWEEN COMBINATORIAL PRINCIPLES

0 references

Ramsey’s theorem for singletons and strong computable reducibility

0 references

Counting the changes of random Δ20 sets

0 references

Spectra of highn and non-lown degrees

0 references

Every sequence is reducible to a random one

0 references

Problem of the number of non-self-equivalent constructivizations

0 references

Autostability of models

0 references

Constructive models of complete solvable theories

0 references

Recursively presentable prime models

0 references

COMPUTABLE FUNCTORS AND EFFECTIVE INTERPRETABILITY

0 references

Computable trees, prime models, and relative decidability

0 references

Slicing the Truth

0 references

On notions of computability-theoretic reduction between Π21 principles

0 references

The Strength of Some Combinatorial Principles Related to Ramsey's Theorem for Pairs

0 references

COARSE REDUCIBILITY AND ALGORITHMIC RANDOMNESS

0 references

Asymptotic density and the coarse computability bound

0 references

Degree spectra and computable dimensions in algebraic structures

0 references

Categoricity properties for computable algebraic fields

0 references

Using random sets as oracles

0 references

Combinatorial principles weaker than Ramsey's Theorem for pairs

0 references

Nonexistence of minimal pairs for generic computability

0 references

THE GENERIC DEGREES OF DENSITY-1 SETS, AND A CHARACTERIZATION OF THE HYPERARITHMETIC REALS

0 references

Ramsey's theorem and recursion theory

0 references

Generic computability, Turing degrees, and asymptotic density

0 references

Degrees of orderings not isomorphic to recursive linear orderings

0 references

Generic-case complexity, decision problems in group theory, and random walks.

0 references

Comparing notions of randomness

0 references

Limitwise monotonic sequences and degree spectra of structures

0 references

Kolmogorov complexity and the Recursion Theorem

0 references

Degrees coded in jumps of orderings

0 references

Computable Boolean algebras

0 references

Computable categoricity of trees of finite height

0 references

Random reals and Lipschitz continuity

0 references

Randomness and the linear degrees of computability

0 references

RT<sub>2</sub><sup>2</sup> does not imply WKL<sub>0</sub>

0 references

Cone avoiding closed sets

0 references

Approximations to the halting problem

0 references

Enumerations and completely decomposable torsion-free abelian groups

0 references

The Kolmogorov-Loveland stochastic sequences are not closed under selecting subsequences

0 references

On the construction of effectively random sets

0 references

Kolmogorov-Loveland randomness and stochasticity

0 references

Partition Theorems and Computability Theory

0 references

Foundations of recursive model theory

0 references

Omitting types, type spectrums, and decidability

0 references

Randomness and Computability: Open Questions

0 references

The -spectrum of a linear order

0 references

<i>d</i>-computable categoricity for algebraic fields

0 references

A COMPUTABLE FUNCTOR FROM GRAPHS TO FIELDS

0 references

A Unifying Approach to the Gamma Question

0 references

Equivalence between Fraïssé's conjecture and Jullien's theorem

0 references

Mathematical metaphysics of randomness

0 references

The weakness of being cohesive, thin or free in reverse mathematics

0 references

OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS

0 references

Recursively Categorical Linear Orderings

0 references

Degrees of Structures

0 references

0 references

A unified approach to the definition of random sequences

0 references

Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)

0 references

On the strength of Ramsey's theorem

0 references

0 references

Relative to any nonrecursive set

0 references

Hyperarithmetically Encodable Sets

0 references

0 references

0 references

Recursive and r.e. quotient Boolean algebras

0 references

0 references

A separation of two randomness concepts

0 references

Enumerations, countable structures and Turing degrees

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2973717

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2973717&oldid=36313625"