| Safe Haskell | None |
|---|---|
| Language | GHC2024 |
Circuit.Logics.Boolean
Description
Boolean algebras: Heyting + complements (classical logic structure).
Synopsis
- class BoundedLattice a => Complemented a where
- complement :: a -> a
- type Boolean a = (Heyting a, Complemented a)
Documentation
class BoundedLattice a => Complemented a where Source #
Lattice complement (negation).
Methods
complement :: a -> a Source #
Instances
| Complemented H3 Source # | Pseudo-complement |
Defined in Circuit.Logics.H3 Methods complement :: H3 -> H3 Source # | |
| Complemented Bool Source # | |
Defined in Circuit.Logics.Boolean Methods complement :: Bool -> Bool 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 # | |
type Boolean a = (Heyting a, Complemented a) Source #
Boolean algebra: Heyting with complements satisfying excluded middle and non-contradiction (see Circuit.Logics.Laws).