| Safe Haskell | None |
|---|---|
| Language | GHC2024 |
Circuit.Logics.H3
Description
H3 — smallest Heyting algebra that is not Boolean.
Values: true false unknown. Implication is defined so Heyting laws
hold; excluded middle fails at HUnknown.
Epistemic reading: "do we know enough to assert?" — a natural output
alphabet for Process obs H3.
Documentation
Three-valued Heyting algebra (intuitionistic toy model).
Instances
| Eq H3 Source # | |
| Ord H3 Source # | |
| Bounded H3 Source # | |
| Enum H3 Source # | |
| Read H3 Source # | |
| Show H3 Source # | |
| Complemented H3 Source # | Pseudo-complement |
Defined in Circuit.Logics.H3 Methods complement :: H3 -> H3 Source # | |
| Heyting H3 Source # | |
| JoinSemiLattice H3 Source # | |
| LowerBounded H3 Source # | |
Defined in Circuit.Logics.H3 | |
| MeetSemiLattice H3 Source # | |
| UpperBounded H3 Source # | |
Defined in Circuit.Logics.H3 | |