Kirk Rader  1.0-SNAPSHOT
Packages | Classes
Package us.rader.tt.formula

Processor for well-formed formulas of the monadic predicate calculus. More...

Packages

package  test
 Unit tests for classes in us.rader.tt.formula.
 

Classes

class  Biconditional
 "Equivalence" operator. More...
 
class  Conditional
 "Implies" operator. More...
 
class  Conjunction
 "And" operator. More...
 
class  Connective
 A connective. More...
 
class  Description
 Definite description (reverse iota). More...
 
class  Disjunction
 "Inclusive or" operator. More...
 
class  ExistentialGeneralization
 Existential generalization. More...
 
class  Expression
 Objects with unique Graphviz node names. More...
 
class  Formula
 A formula of the monadic predicate calculus. More...
 
interface  Graphable
 Objects that can render themselves as Graphviz digraphs. More...
 
class  Identity
 Identity, i.e. More...
 
class  Negation
 "Not" operator. More...
 
class  Operator
 A non-terminal Formula of the monadic predicate calculus. More...
 
class  Predicate
 A predicate, i.e. More...
 
class  Sentence
 An atomic sentence represented by an upper-case letter (P, Q etc.). More...
 
class  SymbolicNode
 A sentence or predicate. More...
 
class  UniversalGeneralization
 Universal generalization. More...
 
class  Variable
 A variable (lower-case alphabetic character) of the monadic predicate calculus. More...
 
class  VariableBindingOperator
 Generalization. More...
 

Detailed Description

Processor for well-formed formulas of the monadic predicate calculus.

See Parsing Symbolic Logic Formulas for details.

See TT for a simple integration test and demonstraton of this library's features.