Ordered syntactic algebras of finite presentations
Lax369799.FiniteOrderedAlgebra · concepts/Lax369799/FiniteOrderedAlgebra.lean · lax-369799
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
For yield acceptance, binary disjoint union induces meet on the contextual quotient. The substitution algebra recognizes the original language on reachable deterministic systems.
Concept map
Evidence
This concept declares 5 statements. Each proof establishes one of them relative to its assumptions.
1 evaluation_cover proven
2 evaluation_morphism proven
3 language_recognition proven
4 principal_acceptance proven
5 sum_value_meet proven
Lean source view on GitHub
Show ProofShow ProofShow ProofShow ProofShow Proof
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments