∏ 0 1 Classes and Degrees of Theories

Decidability of theories and sets of sentences (03B25) Other degrees and reducibilities in computability and recursion theory (03D30) General logic (03B99)

Cited in

(only showing first 100 items - show all)

Iterative forcing and hyperimmunity in reverse mathematics
Turing incomparability in Scott sets
Arithmetical Sacks forcing
Chain conditions in computable rings
Milliken’s Tree Theorem and Its Applications: A Computability-Theoretic Perspective
Pigeons do not jump high
The reverse mathematics of \textsf{CAC for trees}
The complexity of recursive constraint satisfaction problems
Members of thin \(\Pi_1^0\) classes and generic degrees
An inside/outside Ramsey theorem and recursion theory
Recursively enumerable sets and degrees
Uncountable degree spectra
On relative randomness
Depth, highness and DNR degrees
Combinatorial principles concerning approximations of functions
The Ginsburg-Sands theorem and computability theory
A basis theorem for Π₁⁰ classes of positive measure and jump inversion for random reals
Cone avoidance and randomness preservation
Factorization of polynomials and \(\Sigma ^ 0_ 1\) induction
The noneffectivity of Arslanov's completeness criterion and related theorems
Measure theory and weak König's lemma
The reverse mathematics of non-decreasing subsequences
Weihrauch Complexity in Computable Analysis
On the number of infinite sequences with trivial initial segment complexity
Learning families of closed sets in matroids
The canonical Ramsey theorem and computability theory
Recursively presented games and strategies
The proof-theoretic strength of Ramsey's theorem for pairs and two colors
GENERALIZATIONS OF THE RECURSION THEOREM
The weakness of being cohesive, thin or free in reverse mathematics
The axiomatic power of Kolmogorov complexity
On degree-preserving homeomorphisms between trees in computable topology
Randomness below complete theories of arithmetic
The prehistory of the subsystems of second-order arithmetic
On the uniform computational content of computability theory
On the degree spectrum of a \(\Pi ^0_1\) class
Degrees of bi-embeddable categoricity
Subsystems of second-order arithmetic between \(\text{RCA}_{0}\) and \(\text{WKL}_{0}\)
Open questions about Ramsey-type statements in reverse mathematics
Orders on magmas and computability theory
Characterizing the strongly jump-traceable sets via randomness
Comparing the degrees of enumerability and the closed Medvedev degrees
THE REVERSE MATHEMATICS OF THE THIN SET AND ERDŐS–MOSER THEOREMS
Some conservation results on weak König's lemma
Degrees of unsolvability: a tutorial
Effectively closed sets and graphs of computable real functions.
Demuth randomness and computational complexity
Lowness for genericity
Cohesive sets and rainbows
Propagation of partial randomness
Computable categoricity for algebraic fields with splitting algorithms
Relativized Schnorr tests with universal behavior
Diagonally non-computable functions and fireworks
A blend of methods of recursion theory and topology: a _1⁰ tree of shadow points
Generalized notions of mind change complexity
Immunity for closed sets
Graph colorings and recursively bounded \(\Pi ^ 0_ 1\)-classes
Turing degrees of multidimensional SFTs
The upward closure of a perfect thin class
Spaces of orders and their Turing degree spectra
On categoricity spectra for locally finite graphs
A contrast to the low basis theorem
Enumerations of \(\Pi^0_1\) classes: acceptability and decidable classes
Minimal Covers and Hyperdegrees
PA RELATIVE TO AN ENUMERATION ORACLE
Inside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functions
Small \(\Pi^{0}_{1}\) classes
Searching for an analogue of \(\text{ATR}_0\) in the Weihrauch lattice
Mappings related to permutations
Mass problems associated with effectively closed sets
Epistemic entrenchment and arithmetical hierarchy
The Medvedev lattice of computably closed sets
Oscillation in the initial segment complexity of random reals
Index sets for ^0_1 classes
Relatively computably enumerable reals
ALMOST THEOREMS OF HYPERARITHMETIC ANALYSIS
On trees without hyperimmune branches
Randomness and universal machines
Computability in uncountable binary trees
Automorphisms of the lattice of \(\Pi_1^0\) classes; perfect thin classes and anc degrees
The reverse mathematics of the Tietze extension theorem
Relationships between computability-theoretic properties of problems
Effectively closed mass problems and intuitionism
Coding true arithmetic in the Medvedev degrees of ^0_1 classes
Countable algebra and set existence axioms
Randomness for non-computable measures
Closed choice and a uniform low basis theorem
Recursion theory and ordered groups
A context for belief revision: forward chaining-normal nonmonotonic rule systems
Effectively closed sets and enumerations
A theory of nonmonotonic rule systems. II
Recursive Quantum Functions, Avoidable Points, & Shadow Points in Recursive Analysis
EXPANDING THE REALS BY CONTINUOUS FUNCTIONS ADDS NO COMPUTATIONAL POWER
Abstract complexity theory and the \(\Delta_{2}^{0}\) degrees
Computability of Subsets of Metric Spaces
The metamathematics of Stable Ramsey’s Theorem for Pairs
Reverse mathematics and fully ordered groups
Degrees of autostability relative to strong constructivizations of graphs
Direct construction of Scott ideals
On some formalized conservation results in arithmetic

This page was built for publication: ∏ 0 1 Classes and Degrees of Theories

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5677474)