Is Regular mul
Cslib.Language.IsRegular.mul
Plain-language statement
The concatenation of two regular languages is regular.
Source project: Lean Computer Science Library
Person-level attribution pending.
Source-pinned research
Search theorem names, mathematical ideas, modules, topics, projects, and role-labelled researchers. Open a result for its complete indexed Lean declaration and source record.
This index contains 199 research declarations. Search 10,000 more complete Mathlib declarations.
199 results
Clear filtersCslib.Language.IsRegular.mul
Plain-language statement
The concatenation of two regular languages is regular.
Source project: Lean Computer Science Library
Person-level attribution pending.
Cslib.Logic.CLL.PhaseSpace.sInf_isFact
Plain-language statement
Arbitrary intersections of facts are facts.
Source project: Lean Computer Science Library
Person-level attribution pending.
Cslib.Logic.CLL.Proof.isMLL_cutFree
Plain-language statement
If a CLL derivation is cut-free and concludes an MLL sequent, then it is an MLL derivation.
Source project: Lean Computer Science Library
Person-level attribution pending.
Cslib.Logic.HML.theoryEq_isBisimulation
Plain-language statement
Theory equivalence is a bisimulation.
Source project: Lean Computer Science Library
Person-level attribution pending.
Cslib.Logic.PL.DerivableIn.cut_away
Plain-language statement
Remove unnecessary hypotheses. This can't be computable because it requires picking an order on the finset Δ.
Source project: Lean Computer Science Library
Person-level attribution pending.
Cslib.Logic.PL.Theory.equiv_iff_equiv_derivableIn_hypothesis
Plain-language statement
A and B are equivalent (in T) iff they have the same strength as hypotheses.
Source project: Lean Computer Science Library
Person-level attribution pending.