raa_tt 0.9.1

Proves sentences of propositional calculus
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15

use crate::proposition::Proposition;
use std::fmt::{Debug, Display, Error, Formatter};

#[derive(Clone, Debug, Default, PartialEq, Eq)]
/// BiImplication struct represents a binary logical biconditional operation.
pub struct BiImplication {
    pub left: Box<Proposition>,
    pub right: Box<Proposition>,
}

impl Display for BiImplication {
    fn fmt(&self, f: &mut Formatter<'_>) -> std::result::Result<(), Error> {
        write!(f, "({} <-> {})", self.left, self.right)
    }
}