| Safe Haskell | None |
|---|---|
| Language | GHC2024 |
Circuit.Logics.Goedel
Description
Gödel–Dummett fuzzy logic on an ordered unit interval.
Meetjoin are minmax; implication is the standard Gödel rule. Heyting but not Boolean: excluded middle fails for intermediate degrees.
Documentation
Gödel truth degree, intended in [0,1].
The constructor is strict about bounds via mkGoedel; the newtype is
still exposed for zero-cost unwrapping when the invariant is trusted.
Constructors
| Goedel r |
Instances
| Eq r => Eq (Goedel r) Source # | |
| Ord r => Ord (Goedel r) Source # | |
Defined in Circuit.Logics.Goedel | |
| Read r => Read (Goedel r) Source # | |
| Show r => Show (Goedel r) Source # | |
| (Ord r, Num r) => Complemented (Goedel r) Source # | Gödel negation as |
Defined in Circuit.Logics.Goedel Methods complement :: Goedel r -> Goedel r Source # | |
| (Ord r, Num r) => Heyting (Goedel r) Source # | |
| Ord r => JoinSemiLattice (Goedel r) Source # | |
| (Ord r, Num r) => LowerBounded (Goedel r) Source # | |
Defined in Circuit.Logics.Goedel | |
| Ord r => MeetSemiLattice (Goedel r) Source # | |
| (Ord r, Num r) => UpperBounded (Goedel r) Source # | |
Defined in Circuit.Logics.Goedel | |