On degrees of unsolvability
From MaRDI portal
Publication:2626398
DOI10.2307/1970028zbMath0119.25105MaRDI QIDQ2626398
Publication date: 1959
Published in: Annals of Mathematics. Second Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/1970028
Related Items
Infinitary self-reference in learning theory, Machine learning of higher-order programs, Some strongly undecidable natural arithmetical problems, with an application to intuitionistic theories, Sets of Formulas Valid in Finite Structures, The distribution of properly Σ20 e-degrees, The degrees of hyperhyperimmune sets, Real numbers and functions in the Kleene hierarchy and limits of recursive, rational functions, Recursively enumerable sets which are uniform for finite extensions, Ramsey's theorem and recursion theory, A basis theorem for Π₁⁰ classes of positive measure and jump inversion for random reals, The Halting Problem Relativized to Complements, Upper semi-lattice of binary strings with the relation ``\(x\) is simple conditional to \(y\), Recursive Enumerability and the Jump Operator, Degree theory on \(\aleph_\omega\), Anomalous learning helps succinctness, Computation of recursive functionals using minimal initial segments, Mathematics based on incremental learning -- excluded middle and inductive inference, Reflection in membership equational logic, many-sorted equational logic, Horn logic with equality, and rewriting logic, Lower bounds on degrees of game-theoretic structures, A non-inversion theorem for the jump operator, Several results in program size complexity, On Turing degrees of Walrasian models and a general impossibility result in the theory of decision-making, Equality is a jump, The rhombus classes of degrees of unsolvability. I. The jump properties, \(\mu\)-recursion and infinite limits., The Turing closure of an Archimedean field, Undecidability and 1-types in intervals of the computably enumerable degrees, Reflection in conditional rewriting logic, Kolmogorov complexity for possibly infinite computations, Recursion and topology on \(2^{\leq\omega}\) for possibly infinite computations, C-quasi-minimal enumeration degrees below \(\mathbf c'\), On \(m\)-degrees of recursively enumerable sets, Forcing and reducibilities, A minimal degree less than 0’, Degrees of models, On the First Order Theory of the Arithmetical Degrees, The upper semilattice of degrees ≤ 0′ is complemented, Jumps of quasi-minimal enumeration degrees, On degrees of unsolvability and complexity properties, Recursively enumerable sets and degrees, Double jumps of minimal degrees
