The automaton property of syntactic set-algebras
Lax369799.AutomatonPropertyTheorem · concepts/Lax369799/AutomatonPropertyTheorem.lean · lax-369799
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
A rankwise-finite set-algebra with a plant-invariant accepting principal filter that separates the order has the automaton property (). The syntactic existence corollary () is formulated with expanded continuity in ExpandedSyntacticAlgebra.
Concept map
Lean source view on GitHub
| 1 | import Lax369799.AutomatonProperty |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: The automaton property of syntactic set-algebras |
| 6 | type: theorem |
| 7 | --- |
| 8 | A rankwise-finite set-algebra with a plant-invariant accepting principal |
| 9 | filter that separates the order has the automaton property |
| 10 | (`lemma:ya-automaton-property`). The syntactic existence corollary (`cor:synt-aut-prop`) is formulated |
| 11 | with expanded continuity in ExpandedSyntacticAlgebra. |
| 12 | -/ |
| 13 | |
| 14 | namespace Lax369799.AutomatonPropertyTheorem |
| 15 | open RankedSystems Algebras SetAlgebras SyntacticOrder AutomatonProperty |
| 16 | |
| 17 | axiom automaton_property {A : RankedSet} (E : SetAlgebra A) |
| 18 | (hA : RankwiseFinite A) (f : A 0) |
| 19 | (hp : PlantInvariant E f) (hs : OrderSeparating E f) : HasAutomatonProperty E f |
| 20 | |
| 21 | -- The syntactic existence corollary uses expanded continuity; see |
| 22 | -- ExpandedSyntacticAlgebra.syntactic_automaton_property. |
| 23 | |
| 24 | end Lax369799.AutomatonPropertyTheorem |
| 25 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments