Struct Godel 

pub struct Godel;

Gödel algebra: the minimum t-norm. The canonical Heyting algebra on [0, 1]; its negation is the crisp intuitionistic pseudo-complement. It is also the unique algebra whose ⊗ and ⊕ are BOTH idempotent: by the classical uniqueness result (Klement, Mesiar & Pap, Triangular Norms), min is the only idempotent t-norm and max the only idempotent t-conorm — this is Green et al.’s fuzzy semiring, where every answer degree is a single bottleneck derivation.

Best for intersections — min is the largest t-norm, so it preserves degree through AND.

Trait Implementations

impl Clone for Godel

fn clone(&self) -> Godel

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Copy for Godel

impl Debug for Godel

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for Godel

fn default() -> Godel

Returns the “default value” for a type.

impl SelectiveOr for Godel

impl Truth for Godel

fn and(a: f32, b: f32) -> f32

Conjunction a ⊗ b (the t-norm). Used for AND and for combining a hop’s premise with its projected scores.

fn or(a: f32, b: f32) -> f32

Disjunction a ⊕ b (the t-conorm), the algebra’s standard dual of ⊗. Used for OR.

fn residuum(a: f32, b: f32) -> f32

The residuum a → b = sup { c : a ⊗ c ≤ b } — the Heyting implication.

fn top() -> f32

⊤, the top (fully true) degree. 1.0.

fn bot() -> f32

⊥, the bottom (false) degree. 0.0.

fn neg(a: f32) -> f32

Negation, the pseudo-complement ¬a = a → ⊥.