Degrees of Unsolvability: A Tutorial (Q3195683)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Degrees of Unsolvability: A Tutorial	scientific article

Statements

scholarly article

0 references

Degrees of Unsolvability: A Tutorial (English)

0 references

zbMATH Open document ID

0 references

10.1007/978-3-319-20028-6_9

0 references

Stephen G. Simpson

0 references

Evolving Computability

0 references

publication date

20 October 2015

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-319-20028-6_9

0 references

0 references

Comparing DNR and WWKL

0 references

The undecidability of the domino problem

0 references

A splitting theorem for the Medvedev and Muchnik lattices

0 references

Mass problems and density

0 references

Embeddings into the Medvedev and Muchnik lattices of \(\Pi^0_1\) classes

0 references

MASS PROBLEMS AND HYPERARITHMETICITY

0 references

Hilbert's Tenth Problem is Unsolvable

0 references

Fixed-point tile sets and their applications

0 references

Applications of sheaves. Proceedings of the research symposium on applications of sheaf theory to logic, algebra and analysis, Durham, July 9--21, 1977

0 references

0 references

0 references

Diagonally non-recursive functions and effective Hausdorff dimension

0 references

MASS PROBLEMS AND INITIAL SEGMENT COMPLEXITY

0 references

0 references

A degree-theoretic definition of the ramified analytical hierarchy

0 references

Degrees of members of \(\Pi_ 1^ 0\) classes

0 references

∏ 0 1 Classes and Degrees of Theories

0 references

FORCING WITH BUSHY TREES

0 references

Kolmogorov complexity and the Recursion Theorem

0 references

The upper semi-lattice of degrees of recursive unsolvability

0 references

Zur Deutung der intuitionistischen Logik

0 references

0 references

0 references

0 references

Extracting information is hard: a Turing degree of non-integral effective Hausdorff dimension

0 references

0 references

Einstein structures: Existence versus uniqueness

0 references

Betti numbers of finitely presented groups and very rapidly growing functions.

0 references

Interpretability and Definability in the Recursively Enumerable Degrees

0 references

Recursively enumerable sets of positive integers and their decision problems

0 references

Recursive unsolvability of group theoretic problems

0 references

Some undecidable problems involving elementary functions of a real variable

0 references

Undecidability and nonperiodicity for tilings of the plane

0 references

The recursively enumerable degrees are dense

0 references

0 references

Coding true arithmetic in the Medvedev and Muchnik degrees

0 references

Degrees of models

0 references

0 references

0 references

0 references

Mass Problems and Randomness

0 references

An extension of the recursively enumerable Turing degrees

0 references

Mass problems and almost everywhere domination

0 references

Mass problems and intuitionism

0 references

Mass Problems and Measure-Theoretic Regularity

0 references

Mass problems associated with effectively closed sets

0 references

Medvedev degrees of two-dimensional subshifts of finite type

0 references

0 references

Computability and Recursion

0 references

Intuitionistic logic and Muchnik degrees

0 references

On Computable Numbers, with an Application to the Entscheidungsproblem

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3195683

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