propositional-tableau-solver-rs 0.1.0

Propositional tableau solver for propositional formulas
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29

//! Unary and binary operators for propositional formulas.

/// There are two types of operators in propositional formulas:
/// 1. `UnaryOperator`: arity 1.
/// 2. `BinaryOperator`: arity 2.
#[derive(Debug, PartialEq, Eq, Hash, Copy, Clone)]
pub enum Operator {
    Unary(UnaryOperator),
    Binary(BinaryOperator),
}

/// There is only one basic unary operator, the negation (logical NOT) operator.
#[derive(Debug, PartialEq, Eq, Hash, Copy, Clone)]
pub enum UnaryOperator {
    Negation,
}

/// There are four basic binary operators:
/// 1. Logical AND.
/// 2. Logical OR.
/// 3. Implication.
/// 4. Biimplication.
#[derive(Debug, PartialEq, Eq, Hash, Copy, Clone)]
pub enum BinaryOperator {
    And,
    Or,
    Implication,
    Biimplication,
}