Package

at.logic.gapt.expr

hol

Permalink

package hol

Content Hierarchy Learn more about scaladoc diagrams
Visibility
  1. Public
  2. All

Type Members

  1. class HOLOrdering extends Ordering[LambdaExpression]

    Permalink
  2. class HOLPosition extends AnyRef

    Permalink

    Positions are given as lists of Integers.

    Positions are given as lists of Integers. The empty list denotes the current expression itself. A list starting with k denotes a subexpression in the kth argument of the current expression.

  3. class TAOrdering extends Ordering[TA]

    Permalink
  4. trait TSkolemSymbol extends AnyRef

    Permalink

Value Members

  1. object BinaryConnective

    Permalink
  2. object CNFn

    Permalink

    Computes a negative CNF of a formula, i.e.

    Computes a negative CNF of a formula, i.e. one that is logically equivalent to the negation of the input formula.

    The computation is done by expanding the input formula using distributivity.

    Quantifiers are removed in the process.

  3. object CNFp

    Permalink

    Computes a positive CNF of a formula, i.e.

    Computes a positive CNF of a formula, i.e. one that is logically equivalent to the input formula.

    The computation is done by expanding the input formula using distributivity.

    Quantifiers are removed in the process.

  4. object DNFn

    Permalink

    Computes a negative DNF of a formula, i.e.

    Computes a negative DNF of a formula, i.e. one that is logically equivalent to the negation of the input formula.

    The computation is done by expanding the input formula using distributivity.

    Quantifiers are removed in the process.

  5. object DNFp

    Permalink

    Computes a positive DNF of a formula, i.e.

    Computes a positive DNF of a formula, i.e. one that is logically equivalent to the input formula.

    The computation is done by expanding the input formula using distributivity.

    Quantifiers are removed in the process.

  6. object HOLOrdering extends HOLOrdering

    Permalink

    Ordering for HOL Formulas (also for FOL)

  7. object HOLPosition

    Permalink
  8. object NaiveIncompleteMatchingAlgorithm

    Permalink
  9. object SkolemSymbolFactory

    Permalink
  10. object TAOrdering extends TAOrdering

    Permalink

    Ordering on types.

  11. object TypeSynonyms

    Permalink
  12. object atoms

    Permalink

    Return the list of all atoms *with duplicates* in the given argument.

    Return the list of all atoms *with duplicates* in the given argument. TODO: why a list? why duplicates? why not a set?

  13. object containsQuantifier

    Permalink

    True iff All or Ex matches any subterm of e.

  14. object containsQuantifierOnLogicalLevel

    Permalink

    True iff All or Ex is contained in the logical structure of the given HOLFormula.

    True iff All or Ex is contained in the logical structure of the given HOLFormula. For example, P( (all x:x) ) contains a quantifier, but it is inside of an atom.

  15. object containsStrongQuantifier

    Permalink
  16. object dualize

    Permalink

    Dualize a formula in NNF by switching conjunctions with disjunctions, universal with existential quantifiers, top with bottom and positive literals with negative literals.

    Dualize a formula in NNF by switching conjunctions with disjunctions, universal with existential quantifiers, top with bottom and positive literals with negative literals. The formula dualize( A ) is logically equivalent to the negation of A.

  17. object existsclosure

    Permalink
  18. object freeHOVariables

    Permalink
  19. object instantiate

    Permalink

    Instantiates a formula with terms.

  20. object isAtom

    Permalink

    Returns true iff the given HOLFormula is an atom (which does not include top nor bottom).

  21. object isExtendedAtom

    Permalink

    Returns true iff the given HOLFormula is an extended atom, i.e.

    Returns true iff the given HOLFormula is an extended atom, i.e. an atom or top or bottom.

  22. object isLogicalConstant

    Permalink

    Returns true iff the given LambdaExpression consists of a logical constant.

  23. object isNeg

    Permalink

    Returns true iff the given HOLFormula starts with a negation.

  24. object isPrenex

    Permalink

    Returns true iff the given formula is prenex.

  25. object isReflexivity

    Permalink

    Returns true iff the given HOLFormula is a reflexivity atom.

  26. object lcomp

    Permalink

    the logical complexity of this formula, i.e.

    the logical complexity of this formula, i.e. the number of logical connectives and atoms starting from the root of the formula. The inner structure of atoms is not counted.

  27. object normalizeFreeVariables

    Permalink
  28. object numOfAtoms

    Permalink

    Return the number of atoms in the given argument.

  29. object removeAllQuantifiers

    Permalink
  30. object removeNeg

    Permalink

    Remove the leading negation from a formula.

  31. object removeQuantifiers

    Permalink
  32. object simplify

    Permalink

    Simplify a HOLFormula using the equations for bottom and top as well as idempotence of conjunction and disjunction.

  33. object toAbbreviatedString

    Permalink
  34. object toNNF

    Permalink

    Transforms a formula to negation normal form (transforming also implications into disjunctions)

  35. object toPrettyString

    Permalink

    Formats a HOL expression without types and the outermost parenthesis.

    Formats a HOL expression without types and the outermost parenthesis. Conjunction, disjunction and implication are considered right associative, i.e. a /\ ((b /\ c) /\ d) = a /\ (b /\ c) /\ d. Equation is rendered infix.

  36. package unification

    Permalink
  37. object univclosure

    Permalink
  38. object variablesAll

    Permalink
  39. object variablesEx

    Permalink

Ungrouped