Skip to main content

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 2,569 curated research declarations and 119,070 complete package declarations. Search 10,000 more complete Mathlib declarations.

All topics

Showing 601 to 606 of 2,569 results.

Project-declaredLean 4.33.0-rc1

Omega not Rcvd enabled

Cslib.FLP.Algorithm.omega_notRcvd_enabled

Mathematical statement

A message that is in-flight stays in-flight as long as it is not received (infinite execution version).

computer sciencecomputabilityprogram semantics

Source project: Lean Computer Science Library

Person-level attribution pending.

View proof record
Project-declaredLean 4.33.0-rc1

Recv Msg comm

Cslib.FLP.Algorithm.recvMsg_comm

Mathematical statement

If m1 and m2 are both inflight and they have different destinations, then receiving them in either order produces the same end state.

computer sciencecomputabilityprogram semantics

Source project: Lean Computer Science Library

Person-level attribution pending.

View proof record
Project-declaredLean 4.33.0-rc1

Tr diamond

Cslib.FLP.Algorithm.tr_diamond

Mathematical statement

A diamond property for the transition relation a.lts.Tr.

computer sciencecomputabilityprogram semantics

Source project: Lean Computer Science Library

Person-level attribution pending.

View proof record
Project-declaredLean 4.33.0-rc1

Diamond

Cslib.FLP.CanReachVia.diamond

Project documentation

A diamond property for CanReachVia. This theorem formalizes Proposition 1 of [Volzer2004].

computer sciencecomputabilityprogram semantics

Source project: Lean Computer Science Library

Person-level attribution pending.

View proof record
Project-declaredLean 4.33.0-rc1

Subset inp

Cslib.FLP.CanReachVia.subset_inp

Mathematical statement

If inputs inp1 and inp2 agree on all processes in ps and state s is reachable from the initial state determined by inp1 by receiving messages with destinations in ps only, then there exists a state s2 that agrees with s on the states of all processes and is reachable from the initial state determined by inp2 by receiving messages with de...

computer sciencecomputabilityprogram semantics

Source project: Lean Computer Science Library

Person-level attribution pending.

View proof record