Which number theoretic problems can be solved in recursive progressions on Π11-paths through O?

DOI10.2307/2272975zbMath0255.02048OpenAlexW2009171410MaRDI QIDQ5668463

Georg Kreisel

Publication date: 1972

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2272975

Mathematics Subject Classification ID

Applications of computability and recursion theory (03D80) Higher-type and set recursion theory (03D65) Hierarchies of computability and definability (03D55) Connections of number theory and logic (11U99)

Related Items (6)

Squeezing Feasibility ⋮ Verificationism and Classical Realizability ⋮ A notion of mechanistic theory ⋮ The creating subject, the Brouwer-Kripke schema, and infinite proofs ⋮ Incompleteness, Mechanism, and Optimism ⋮ Mechanism, truth, and Penrose's new argument

Cites Work

• Reducibility and Completeness for Sets of Integers

This page was built for publication: Which number theoretic problems can be solved in recursive progressions on Π₁¹-paths through O?