Extending and interpreting Post's programme
From MaRDI portal
Publication:636317
DOI10.1016/j.apal.2009.06.007zbMath1225.03050OpenAlexW2025343952MaRDI QIDQ636317
Publication date: 26 August 2011
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apal.2009.06.007
Philosophical and critical aspects of logic and foundations (03A05) Applications of computability and recursion theory (03D80) Recursively (computably) enumerable sets and degrees (03D25) Algorithmic randomness and dimension (03D32) Hierarchies of computability and definability (03D55)
Related Items (1)
Cites Work
- Weak density and cupping in the d-r.e. degrees
- Classical recursion theory. Vol. II
- Isolation and the high/low hierarchy
- Definability as hypercomputational effect
- Bounding computably enumerable degrees in the Ershov hierarchy
- Lowness properties and randomness
- On degrees of unsolvability
- Algorithmic Randomness and Complexity
- TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
- Calibrating Randomness
- Recursively enumerable sets modulo iterated jumps and extensions of Arslanov's completeness criterion
- Post's program and incomplete recursively enumerable sets.
- Degrees of classes of RE sets
- Automorphisms of the lattice of recursively enumerable sets
- Definable Encodings in the Computably Enumerable Sets
- On the Lattice of Recursively Enumerable Sets
- Definability, Automorphisms, and Dynamic Properties of Computably Enumerable Sets
- Computability and Randomness
- Post's Programme for the Ershov Hierarchy
- Trial and error predicates and the solution to a problem of Mostowski
- Degrees of recursively enumerable sets which have no maximal supersets
- Limiting recursion
- The Δ₃⁰-automorphism method and noninvariant classes of degrees
- Machines, Computations, and Universality
- On Computable Numbers, with an Application to the Entscheidungsproblem
- Systems of Logic Based on Ordinals†
- Arithmetical problems and recursively enumerable predicates
- Recursively enumerable sets of positive integers and their decision problems
- SOFSEM 2006: Theory and Practice of Computer Science
- Theory and Applications of Models of Computation
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Extending and interpreting Post's programme
