Dedekind 0.0.0
A structuralist C++23 Module Library
Loading...
Searching...
No Matches
dedekind::category::IsTransitive Concept Referenceexport

Formal verification: (a ≤ b ∧ b ≤ c) ⇒ a ≤ c. More...

Concept definition

template<typename T, typename Rel, typename Ω bool>
requires(const std::remove_cvref_t<Rel>& rel, const T& a, const T& b) {
{ rel(a, b) } -> std::convertible_to<Ω>;
} && requires { requires is_transitive_v<T, std::remove_cvref_t<Rel>>; }
Formal verification: (a ≤ b ∧ b ≤ c) ⇒ a ≤ c.
Definition mereology.cppm:131
Ω may carry a relation's answer in the laws below: it has a top ⊤, the value a law asserts (reflexivi...
Definition mereology.cppm:63

Detailed Description

Formal verification: (a ≤ b ∧ b ≤ c) ⇒ a ≤ c.