Acceptance through resolution values
Lax369799.AcceptanceObservations · concepts/Lax369799/AcceptanceObservations.lean · lax-369799
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
For a language recognized by an unfolding-invariant algebra, universal yield acceptance is exactly containment of both initial and root observation values in the accepting set of the algebra.
Concept map
Evidence
Each proof establishes this claim relative to its assumptions.
Lean source view on GitHub
| 1 | import Lax369799.PresentationObservations |
| 2 | import Lax369799.FiniteAcceptance |
| 3 | |
| 4 | /-! |
| 5 | --- |
| 6 | title: Acceptance through resolution values |
| 7 | type: theorem |
| 8 | --- |
| 9 | For a language recognized by an unfolding-invariant algebra, universal yield |
| 10 | acceptance is exactly containment of both initial and root observation values |
| 11 | in the accepting set of the algebra. |
| 12 | -/ |
| 13 | namespace Lax369799.AcceptanceObservations |
| 14 | open RankedSystems Algebras PresentationObservations |
| 15 | |
| 16 | axiom accepting_iff_values {A B : RankedSet} (E : Algebra B) (hE : UnfoldInvariant E) |
| 17 | (η : RankedMap A B) (F : Set (B 0)) (L : Language A) (hL : Recognizes E η F L) |
| 18 | {V : Type} [Fintype V] (G : Presentation A 0 V) : |
| 19 | SyntacticOrder.Accepting L (trim G) ↔ |
| 20 | values E η G ⊆ F ∧ values E η (RootExpansion.startAtRoots G) ⊆ F |
| 21 | |
| 22 | end Lax369799.AcceptanceObservations |
| 23 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments