Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Oracle programs exactly capture relative partial recursiveness

Proved
FriedbergMuchnik.oracle_programs_exact

by tomasz · Sep 9, 2026 · Mathlib 0df444a (Lean v4.33.1)

computability-theoryfriedberg-muchnikpriority-construction

Let O,f:N⇀NO,f:\mathbb N\rightharpoonup\mathbb NO,f:N⇀N be arbitrary partial functions. Let eval⁡O(c)\operatorname{eval}^{O}(c)evalO(c) denote the partial function interpreted from an oracle program ccc in the imported language. Then

f is partial recursive relative to O⟺∃c, eval⁡O(c)=f.f\text{ is partial recursive relative to }O\quad\Longleftrightarrow\quad\exists c,\ \operatorname{eval}^{O}(c)=f.f is partial recursive relative to O⟺∃c, evalO(c)=f.

The programs use oracle queries, successor, pairing projections, pairing, composition, primitive recursion, and minimization from zero. The constant-zero function is expressible within this language. Equality is equality of partial functions, including their domains; no totality assumption is imposed on OOO or fff.

This equivalence connects explicit program requirements to Mathlib's RecursiveIn and hence to the mission's Turing-reducibility predicate.

Preamble
import Definitions.Def_FriedbergMuchnik_Priority
Formal statement
namespace FriedbergMuchnik

theorem oracle_programs_exact (O f : ℕ →. ℕ) :
    RecursiveIn {O} f ↔ ∃ c : Program, oracleEval O c = f := by sorry

end FriedbergMuchnik
Source
Formalization bridge for the oracle programs in Arnold W. Miller, Lecture notes in Recursion Theory, December 3, 2008, Section 26, Theorem 26.2, pp. 51–54, https://people.math.wisc.edu/~awmille1/old/m773-07/recthy.pdf#page=51; semantics follows Mathlib Nat.RecursiveIn and RecursiveIn.iff_nat, https://github.com/leanprover-community/mathlib4/blob/0df444a360eaa60ab8c11dca51a86af692955474/Mathlib/Computability/RecursiveIn.lean. Program-tree encoding is transported from Nat.Partrec.Code, https://github.com/leanprover-community/mathlib4/blob/0df444a360eaa60ab8c11dca51a86af692955474/Mathlib/Computability/PartrecCode.lean.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me