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

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
Some logically weak Ramseyan theorems
Members of countable \(\Pi ^ 0_ 1\) classes
Whitehead's problem and reverse mathematics
\(\Pi_{1}^{0}\) classes and orderable groups
Infinite dimensional proper subspaces of computable vector spaces
Degrees of Indiscernibles in Decidable Models
Medvedev degrees of generalized r.e. separating classes
Reverse mathematics and Weihrauch analysis motivated by finite complexity theory
Deep \(\Pi_1^0\) classes
The members of thin and minimal \(\Pi_1^0\) classes, their ranks and Turing degrees
Effective algebraicity
Logic programs, well-orderings, and forward chaining
When does randomness come from randomness?
Putnam's theorem on the complexity of models
Effective categoricity for distributive lattices and Heyting algebras
Degrees containing members of thin \(\Pi_1^0\) classes are dense and co-dense
Weakly represented families in reverse mathematics
The metamathematics of ergodic theory
The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma
Recursively compressible sets
On the strength of König's duality theorem for infinite bipartite graphs
On uniform relationships between combinatorial problems
Weak truth table degrees of structures
Array nonrecursiveness and relative recursive enumerability
Decidable categoricity spectra for almost prime models
COMPUTABLY COMPACT METRIC SPACES
An effectively closed set with no join property*
Index sets in computable analysis
A note on the join property
Thin set theorems and cone avoidance
Maximal theories
Term extraction and Ramsey's theorem for pairs
Randomness notions and reverse mathematics
A blend of methods of recursion theory and topology.
Confident and consistent partial learning of recursive functions
Fixed point theorems for precomplete numberings
Computational processes, observers and Turing incompleteness
The weakness of the pigeonhole principle under hyperarithmetical reductions
INFINITE STRINGS AND THEIR LARGE SCALE PROPERTIES
Probabilistic computability and choice
Ideals in computable rings
\(\varPi^1_1\)-conservation of combinatorial principles weaker than Ramsey's theorem for pairs
Computability-theoretic and proof-theoretic aspects of partial and linear orderings
Formalizing forcing arguments in subsystems of second-order arithmetic
Recursive Euler and Hamilton Paths
Partial recursive functions and finality
Lowness, Randomness, and Computable Analysis
Coloring trees in reverse mathematics
\( \mathsf{SRT}_2^2\) does not imply \(\mathsf{RT}_2^2\) in \(\omega \)-models
The atomic model theorem and type omitting
On self-embeddings of computable linear orderings
Prime model with no degree of autostability relative to strong constructivizations
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

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)