Struct PowerSetHeyting 

pub struct PowerSetHeyting {
    pub universe: u64,
}

Finite Heyting algebra as a power-set lattice over n atoms. Elements are represented as bitmasks of subsets of {0, …, n-1}.

Fields

universe: u64

Implementations

impl PowerSetHeyting

pub fn new(n: u32) -> Self

pub fn meet(&self, a: u64, b: u64) -> u64

pub fn join(&self, a: u64, b: u64) -> u64

pub fn top(&self) -> u64

pub fn bot(&self) -> u64

pub fn neg(&self, a: u64) -> u64

pub fn implication(&self, a: u64, b: u64) -> u64

Heyting implication: a → b = ⋁{x | x ∧ a ≤ b}.

pub fn le(&self, a: u64, b: u64) -> bool

pub fn double_neg(&self, a: u64) -> u64

Double negation: ¬¬a in a Boolean algebra equals a.

Trait Implementations

impl Clone for PowerSetHeyting

fn clone(&self) -> PowerSetHeyting

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for PowerSetHeyting

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

Formats the value using the given formatter.

impl PartialEq for PowerSetHeyting

fn eq(&self, other: &PowerSetHeyting) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Copy for PowerSetHeyting

impl Eq for PowerSetHeyting

impl StructuralPartialEq for PowerSetHeyting