OAI/Probability/CriticalZ3/Exploration.lean
28 declarations, 0 contain sorry, 0 declared as axioms
- structure
OAI.CriticalZ3.Coarse.Packetline 14Source documentation
A packet stores exactly the finite parent-chain graph, extended only on assignment.
structure Packet (r : ℕ) where …
- def
OAI.CriticalZ3.Coarse.Packet.eventline 23 - theorem
OAI.CriticalZ3.Coarse.Packet.measurableSet_eventline 26 - theorem
OAI.CriticalZ3.Coarse.Packet.event_determinedline 29 - def
OAI.CriticalZ3.Coarse.Packet.childline 33 - theorem
OAI.CriticalZ3.Coarse.Packet.child_bitsline 40 - structure
OAI.CriticalZ3.Coarse.Explorationline 45 - def
OAI.CriticalZ3.Coarse.Exploration.visitedline 54 - def
OAI.CriticalZ3.Coarse.Exploration.revealline 56 - def
OAI.CriticalZ3.Coarse.Exploration.afterline 60 - def
OAI.CriticalZ3.Coarse.Exploration.candidatesline 62 - def
OAI.CriticalZ3.Coarse.Exploration.Acceptline 65 - def
OAI.CriticalZ3.Coarse.Exploration.markedBadline 69 - def
OAI.CriticalZ3.Coarse.Exploration.advanceline 74 - theorem
OAI.CriticalZ3.Coarse.Exploration.reveal_disjointline 88 - def
OAI.CriticalZ3.Coarse.Exploration.schemeline 93 - structure
OAI.CriticalZ3.Coarse.Exploration.Validline 102 - theorem
OAI.CriticalZ3.Coarse.outward_injectiveline 118 - theorem
OAI.CriticalZ3.Coarse.neighbor_neline 122 - theorem
OAI.CriticalZ3.Coarse.Exploration.mem_candidatesline 130 - theorem
OAI.CriticalZ3.Coarse.Exploration.queue_visitedline 134 - theorem
OAI.CriticalZ3.Coarse.Exploration.processed_visitedline 138 - theorem
OAI.CriticalZ3.Coarse.Exploration.candidates_distinctline 140 - theorem
OAI.CriticalZ3.Coarse.Exploration.advance_emptyline 149 - theorem
OAI.CriticalZ3.Coarse.Exploration.current_supportline 158 - theorem
OAI.CriticalZ3.Coarse.Exploration.later_disjointline 169 - theorem
OAI.CriticalZ3.Coarse.Exploration.later_probabilityline 189 - theorem
OAI.CriticalZ3.Coarse.Exploration.valid_advanceline 199