Remove n-ary Partrec' equivalence for smaller PR#60
Merged
jessealama merged 1 commit intomainfrom Jan 24, 2026
Merged
Conversation
Drop PartrecPrime.lean (1371 lines) which proved URMComputable n ↔ Nat.Partrec'. This equivalence can still be derived via Mathlib's Nat.Partrec'.part_iff combined with the unary equivalence Partrec ↔ URMComputable1. The unary equivalence in Partrec.lean + Simulate/ is the more fundamental result that establishes URMs as a complete model of computation.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Summary
PartrecPrime.lean(1371 lines) which provedURMComputable n ↔ Nat.Partrec'Rationale
The n-ary equivalence can still be derived via:
Nat.Partrec'.part_iff : @Partrec' n f ↔ Partrec fPartrec ↔ URMComputable1(preserved inPartrec.lean+Simulate/)The unary equivalence is the more fundamental result that establishes URMs as a complete model of computation.
Test plan
lake buildpasses