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 2,569 research declarations. Search 10,000 more complete Mathlib declarations.
Showing 409 to 414 of 2,569 results.
Cedar.Thm.verifyDisjoint_is_ok_and_complete
Mathematical statement
Concrete version of verifyDisjoint_is_complete.
Source project: Cedar Specification
Person-level attribution pending.
Cedar.Thm.verifyDisjoint_is_ok_and_sound
Mathematical statement
Concrete version of verifyDisjoint_is_sound.
Source project: Cedar Specification
Person-level attribution pending.
Cedar.Thm.verifyEquivalent_is_ok_and_complete
Mathematical statement
Concrete version of verifyEquivalent_is_complete.
Source project: Cedar Specification
Person-level attribution pending.
Cedar.Thm.verifyEquivalent_is_ok_and_sound
Mathematical statement
Concrete version of verifyEquivalent_is_sound.
Source project: Cedar Specification
Person-level attribution pending.
Cedar.Thm.verifyEvaluateOpt_eqv_verifyEvaluate_ok
Project documentation
This theorem covers the "happy path" -- showing that if optimized policy compilation succeeds, then verifyEvaluate and verifyEvaluateOpt are equivalent.
Source project: Cedar Specification
Person-level attribution pending.
Cedar.Thm.verifyEvaluatePair_is_ok
Mathematical statement
verifyEvaluatePair succeeds on sufficiently well-formed inputs.
Source project: Cedar Specification
Person-level attribution pending.