|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use ComposedFormula | |
---|---|
de.uni_tuebingen.sfb.lichtenstein.formulas |
Uses of ComposedFormula in de.uni_tuebingen.sfb.lichtenstein.formulas |
---|
Subclasses of ComposedFormula in de.uni_tuebingen.sfb.lichtenstein.formulas | |
---|---|
class |
BinaryJunctor
A superclass for implication and equivalence, implementing common methods for binary junctors. |
class |
Conjunction
A class representing the conjunction of formulas. |
class |
Disjunction
A class representing the disjunction of formulas. |
class |
Equivalence
A class representing the equivalence in logical formulas. |
class |
FirstOrderExistentialQuantification
A class representing the existential quantification of a formula over a first order variable. |
class |
FirstOrderQuantor
A class for representing quantors on first order variables, implementing common methods for existential and universal quantors. |
class |
FirstOrderUniversalQuantification
A class representing universal quantification of a formula over a first order variable. |
class |
Implication
A class representing the implication of formulas. |
class |
NaryJunctor
A superclass for conjunction and disjunction, implementing common methods for binary junctors. |
class |
Negation
A class representing logical negation of a formula. |
class |
SecondOrderExistentialQuantification
A class representing the existential quantification of a formula over a second order variable. |
class |
SecondOrderQuantor
A class for representing quantors on second order variables, implementing common methods for existential and universal quantors. |
class |
SecondOrderUniversalQuantification
A class representing universal quantification of a formula over a second order variable. |
class |
UnaryJunctor
A class representing a unary junctor, having one argument. |
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |