Project-declaredLean 4.24.0-rc1
Reg lang concat ne
reg_lang_concat_ne
Project documentation
Helper lemma for reg_lang_concat below.
automata theoryformal languagescomputer science
Source project: Automata Theory
Person-level attribution pending.
Source-pinned research
Research proof index
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 filtersView proof record
Project-declaredLean 4.24.0-rc1
Reg lang epsilon
reg_lang_epsilon
Plain-language statement
The language {[]} is regular.
automata theoryformal languagescomputer science
Source project: Automata Theory
Person-level attribution pending.
Project-declaredLean 4.24.0-rc1
Reg lang inter
reg_lang_inter
Plain-language statement
Regular languages are closed under intersection.
automata theoryformal languagescomputer science
Source project: Automata Theory
Person-level attribution pending.
Project-declaredLean 4.24.0-rc1
Reg lang union
reg_lang_union
Plain-language statement
Regular languages are closed under union.
automata theoryformal languagescomputer science
Source project: Automata Theory
Person-level attribution pending.
Project-declaredLean 4.33.0-rc1
Locally Confluent Terminating to Confluent
Relation.LocallyConfluent.Terminating_toConfluent
Project documentation
Newman's lemma: a terminating, locally confluent relation is confluent.
computer sciencecomputabilityprogram semantics
Source project: Lean Computer Science Library
Person-level attribution pending.
Project-declaredLean 4.33.0-rc1
Halting step unique
Turing.MultiTapeTM.halting_step_unique
Plain-language statement
If a Turing machine halts, the time step is uniquely determined.
computer sciencecomputabilityprogram semantics
Source project: Lean Computer Science Library
Person-level attribution pending.