scientific article; zbMATH DE number 3387326

zbMATH Open0245.02037MaRDI QIDQ5656753FDOQ5656753

Authors: Joseph R. Shoenfield 

Publication date: 1971

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Other degrees and reducibilities in computability and recursion theory (03D30)

Cited In (47)

• Generalized rewrite theories, coherence completion, and symbolic methods
• Transducer degrees: atoms, infima and suprema
• The density of the nonbranching degrees
• Machine learning of higher-order programs
• α-Degrees of maximal α-r.e. sets
• A WEAKLY 2-GENERIC WHICH BOUNDS A MINIMAL DEGREE
• \(\delta\)-uniform BSS machines
• Title not available (Why is that?)
• On the computability of ordered fields
• Degrees of Unsolvability: A Tutorial
• Axiomatizing the existential theory of \(\mathbb{F}_q((t))\)
• A recursion theoretic analysis of the clopen Ramsey theorem
• Decreasing diagrams with two labels are complete for confluence of countable systems
• Post's problem and his hypersimple set
• Social choice and computational complexity
• Degrees of Transducibility
• Computably enumerable sets and related issues
• Arithmetic hierarchy of Abelian groups
• Two theorems on degrees of models of true arithmetic
• Degrees joining to 0′
• Spectrum of the field of computable real numbers
• Title not available (Why is that?)
• Comparison of identification criteria for machine inductive inference
• Title not available (Why is that?)
• Busy beaver sets and the degrees of unsolvability
• Branching Degrees above low Degrees
• Lower bounds on degrees of game-theoretic structures
• Double jumps of minimal degrees
• Independent Gödel sentences and independent sets
• Computational complexity, speedable and levelable sets
• On Turing degrees of Walrasian models and a general impossibility result in the theory of decision-making
• Automorphism bases for degrees of unsolvability
• Математические основы теории познания на основе экспериментов
• Some lowness properties and computational complexity sequences
• Перспективы метаматематических структур в науке
• Rice’s Theorem in Effectively Enumerable Topological Spaces
• Priority arguments in the continuous r.e. degrees
• Some elementary degree-theoretic reasons why structures need similarity types
• The minimum degree of recursively representable choice functions
• Isomorphism theorem for BSS recursively enumerable sets over real closed fields
• Anomalous learning helps succinctness
• Degrees of Infinite Words, Polynomials and Atoms
• \(r\)-maximal major subsets
• On the complexity of stream equality
• The irregular and non-hyperregular \(\alpha\)-r.e. degrees
• A hierarchy of families of recursively enumerable degrees
• Degrees of Infinite Words, Polynomials and Atoms

This page was built for publication:

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