Skip to content

feat(Classes): define the polynomial hierarchy - #18

Draft
BoltonBailey wants to merge 3 commits into
SamuelSchlesinger:devfrom
BoltonBailey:feat/polynomial-hierarchy
Draft

feat(Classes): define the polynomial hierarchy#18
BoltonBailey wants to merge 3 commits into
SamuelSchlesinger:devfrom
BoltonBailey:feat/polynomial-hierarchy

Conversation

@BoltonBailey

@BoltonBailey BoltonBailey commented Jul 25, 2026

Copy link
Copy Markdown
Collaborator

This is an in-progress PR to add the definition of the Polynomial Time hierarchy.

🤖 Generated with Claude Code

BoltonBailey and others added 3 commits July 24, 2026 12:53
Define certificate quantifiers over the pair codec (polyExistsLang /
polyForallLang and their class operators), the levels SigmaP / PiP by
the standard recursion through complement classes, and PH as their
union. Prove quantifier and class-level complement duality,
monotonicity, the recursion laws, and level inclusions, the latter
conditional on the single machine-engineering seam `pairFst ∈ FP`
(first-component pair decoding), isolated as a hypothesis following the
WitnessNTMConstruction pattern. Ported from leanprover/cslib#192,
re-proved against this library's machine model and Set-based languages.

Co-Authored-By: Claude Fable 5 <noreply@anthropic.com>
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

1 participant