Publication:3916564
From MaRDI portal
zbMath0465.03024MaRDI QIDQ3916564
Publication date: 1980
Turing degrees; second order arithmetic; codings; initial segments of degrees; n-ary relation quantifiers; quantifiers over ideals
03D30: Other degrees and reducibilities in computability and recursion theory
Related Items
LOGICS FOR PROPOSITIONAL CONTINGENTISM, Embedding and coding below a 1-generic degree, The undecidability of the lattice of r. e. closed subsets of an effective topological space, Not every finite lattice is embeddable in the recursively enumerable degrees, Propositional quantification in the topological semantics for \(\mathbf S4\), Elementary theories and hereditary undecidability for semilattices of numberings, Interpolating \(d\)-r.e. and REA degrees between r.e. degrees, Undecidability of first-order modal and intuitionistic logics with two variables and one monadic predicate letter, The jump is definable in the structure of the degrees of unsolvability, Definable degrees and automorphisms of 𝒟, Strong reducibilities