∏ 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)

Searching for an analogue of \(\text{ATR}_0\) in the Weihrauch lattice
The upward closure of a perfect thin class
A contrast to the low basis theorem
Inside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functions
On categoricity spectra for locally finite graphs
Mappings related to permutations
On trees without hyperimmune branches
Recursive Quantum Functions, Avoidable Points, & Shadow Points in Recursive Analysis
Abstract complexity theory and the \(\Delta_{2}^{0}\) degrees
Degrees of autostability relative to strong constructivizations of graphs
On some formalized conservation results in arithmetic
Whitehead's problem and reverse mathematics
Degrees of Indiscernibles in Decidable Models
Effective algebraicity
Effective categoricity for distributive lattices and Heyting algebras
Array nonrecursiveness and relative recursive enumerability
Recursively compressible sets
A note on the join property
Thin set theorems and cone avoidance
Index sets in computable analysis
Randomness notions and reverse mathematics
Fixed point theorems for precomplete numberings
INFINITE STRINGS AND THEIR LARGE SCALE PROPERTIES
Probabilistic computability and choice
Computability-theoretic and proof-theoretic aspects of partial and linear orderings
Coloring trees in reverse mathematics
\( \mathsf{SRT}_2^2\) does not imply \(\mathsf{RT}_2^2\) in \(\omega \)-models
On self-embeddings of computable linear orderings
Antibasis theorems for \({\Pi^0_1}\) classes and the jump hierarchy
Highness properties close to PA completeness
The degree of decidable categoricity of a model with infinite solutions for complete formulas
Pigeons do not jump high
Depth, highness and DNR degrees
Uncountable degree spectra
A basis theorem for Π₁⁰ classes of positive measure and jump inversion for random reals
Weihrauch Complexity in Computable Analysis
Recursively presented games and strategies
The prehistory of the subsystems of second-order arithmetic
On degree-preserving homeomorphisms between trees in computable topology
Randomness below complete theories of arithmetic
On the uniform computational content of computability theory
Degrees of bi-embeddable categoricity
Subsystems of second-order arithmetic between \(\text{RCA}_{0}\) and \(\text{WKL}_{0}\)
Comparing the degrees of enumerability and the closed Medvedev degrees
Degrees of unsolvability: a tutorial
Some conservation results on weak König's lemma
Computable categoricity for algebraic fields with splitting algorithms
Effectively closed sets and graphs of computable real functions.
Lowness for genericity
Immunity for closed sets
A blend of methods of recursion theory and topology: a \(\Pi_1^0\) tree of shadow points
Enumerations of \(\Pi^0_1\) classes: acceptability and decidable classes
Minimal Covers and Hyperdegrees
Turing degrees of multidimensional SFTs
Spaces of orders and their Turing degree spectra
Small \(\Pi^{0}_{1}\) classes
Mass problems associated with effectively closed sets
Epistemic entrenchment and arithmetical hierarchy
The Medvedev lattice of computably closed sets
Index sets for \(\Pi^0_1\) classes
Oscillation in the initial segment complexity of random reals
Relatively computably enumerable reals
Randomness and universal machines
Automorphisms of the lattice of \(\Pi_1^0\) classes; perfect thin classes and anc degrees
The reverse mathematics of the Tietze extension theorem
Randomness for non-computable measures
Countable algebra and set existence axioms
Effectively closed mass problems and intuitionism
Coding true arithmetic in the Medvedev degrees of \(\Pi^0_1\) classes
Recursion theory and ordered groups
Closed choice and a uniform low basis theorem
A context for belief revision: forward chaining-normal nonmonotonic rule systems
Effectively closed sets and enumerations
A theory of nonmonotonic rule systems. II
Reverse mathematics and fully ordered groups
The metamathematics of Stable Ramsey’s Theorem for Pairs
Some logically weak Ramseyan theorems
Members of countable \(\Pi ^ 0_ 1\) classes
\(\Pi_{1}^{0}\) classes and orderable groups
Reverse mathematics and Weihrauch analysis motivated by finite complexity theory
Deep \(\Pi_1^0\) classes
Infinite dimensional proper subspaces of computable vector spaces
Logic programs, well-orderings, and forward chaining
When does randomness come from randomness?
The metamathematics of ergodic theory
On uniform relationships between combinatorial problems
On the strength of König's duality theorem for infinite bipartite graphs
The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma
Maximal theories
Term extraction and Ramsey's theorem for pairs
A blend of methods of recursion theory and topology.
Confident and consistent partial learning of recursive functions
Computational processes, observers and Turing incompleteness
Ideals in computable rings
Partial recursive functions and finality
\(\varPi^1_1\)-conservation of combinatorial principles weaker than Ramsey's theorem for pairs
Recursive Euler and Hamilton Paths
Formalizing forcing arguments in subsystems of second-order arithmetic
The atomic model theorem and type omitting
Prime model with no degree of autostability relative to strong constructivizations

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)