[−][src]Struct razor_fol::syntax::Theory
Is a first-order theory, containing a set of first-order formulae.
Fields
formulae: Vec<Formula>
Is the list of first-order formulae in this theory.
Methods
impl Theory
[src]
pub fn gnf(&self) -> Theory
[src]
Transforms the given theory to a geometric theory, where all formulae are in Geometric Normal Form (GNF).
Hint: For mor information about GNF, see Geometric Logic in Computer Science by Steve Vickers.
Example:
let theory: Theory = r#" not P(x) or Q(x); Q(x) -> exists y. P(x, y); "#.parse().unwrap(); assert_eq!(r#"P(x) → Q(x) Q(x) → P(x, sk#0(x))"#, theory.gnf().to_string());
Trait Implementations
Auto Trait Implementations
impl RefUnwindSafe for Theory
impl Send for Theory
impl Sync for Theory
impl Unpin for Theory
impl UnwindSafe for Theory
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<T> ToString for T where
T: Display + ?Sized,
[src]
T: Display + ?Sized,
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,