Syntactic algebras with expanded continuity
Lax369799.ExpandedSyntacticAlgebra · concepts/Lax369799/ExpandedSyntacticAlgebra.lean · lax-369799
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
The syntactic quotient is a substitution algebra of finite presentations. Its continuity law resolves base-alphabet representatives after expansion. It applies to every lower bound and every choice of representatives. Finite resolution normal forms retain entire branching components.
Concept map
Evidence
This concept declares 7 statements. Each proof establishes one of them relative to its assumptions.
1 automaton_property proven
2 expanded_normal_form proven
3 expanded_yield_order proven
4 recognition proven
5 representatives_exist proven
6 syntactic_algebra_exists proven
7 syntactic_automaton_property proven
Lean source view on GitHub
Show ProofShow ProofShow ProofShow ProofShow ProofShow ProofShow Proof
Builds on
Used by
From Mathlib
none
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments