Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Primitive recursiveness of bounded evaluation for finite-list oracles

Proved
FriedbergMuchnik.finite_oracle_evaln_primrec

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

computability-theoryfriedberg-muchnikoracle-computationprimitive-recursion

Let LLL be an arbitrary finite list of natural numbers and let OL(n)O_L(n)OL​(n) be 111 when n∈Ln\in Ln∈L and 000 otherwise. Let E(L,k,c,n)E(L,k,c,n)E(L,k,c,n) be the option-valued result of the fixed bounded oracle interpreter oracleEvaln, using oracle OLO_LOL​, fuel k∈Nk\in\mathbb Nk∈N, program ccc, and input n∈Nn\in\mathbb Nn∈N.

Then the function

(L,k,c,n)⟼E(L,k,c,n)(L,k,c,n)\longmapsto E(L,k,c,n)(L,k,c,n)⟼E(L,k,c,n)

is primitive recursive, uniformly in all four arguments, with the existing encodings of lists, programs, products, and optional natural numbers. The result none is a legitimate total output of this bounded simulation.

The statement includes arbitrary lists, with duplicates allowed, fuel zero, and inputs beyond the fuel bound. It assumes no stage invariant, no computability of the priority construction, and no correctness or completeness theorem about unbounded oracle evaluation.

Preamble
import Definitions.Def_FriedbergMuchnik_Priority
Formal statement
namespace FriedbergMuchnik

theorem finite_oracle_evaln_primrec :
    Primrec (fun p : List ℕ × (ℕ × (Program × ℕ)) =>
      oracleEvaln (fun n => if n ∈ p.1 then 1 else 0)
        p.2.1 p.2.2.1 p.2.2.2) := by sorry

end FriedbergMuchnik
Source
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=52. The construction on p. 52 uses a uniformly bounded finite-oracle simulation; p. 53 asserts effectiveness of the finite-stage sequence. This statement is an elementary, formalization-specific coding lemma for the oracleEvaln interpreter already defined in FriedbergMuchnik_Priority, not a verbatim numbered theorem in Miller. The strengthening to primitive recursiveness is justified by the explicit fuel and input bounds, primitive recursive syntax encoding, and bounded loops.

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