Object

at.logic.gapt.proofs.lk

skolemize

Related Doc: package lk

Permalink

object skolemize extends Logger

Linear Supertypes
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. skolemize
  2. Logger
  3. AnyRef
  4. Any
  1. Hide All
  2. Show all
Visibility
  1. Public
  2. All

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  4. def apply(f: FOLFormula, pol: Int, symbols: Stream[SymbolA]): FOLFormula

    Permalink
  5. def apply(f: FOLFormula, pol: Int): FOLFormula

    Permalink
  6. def apply(f: HOLFormula, pol: Int, symbols: Stream[SymbolA]): HOLFormula

    Permalink
  7. def apply(f: HOLFormula, pol: Int): HOLFormula

    Permalink
  8. def apply(fs: HOLSequent): HOLSequent

    Permalink
  9. def apply(p: LKProof): LKProof

    Permalink
  10. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  11. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  12. def copyMap(old_p: LKProof, new_p: LKProof, map: Map[FormulaOccurrence, FormulaOccurrence]): Map[FormulaOccurrence, FormulaOccurrence]

    Permalink
  13. def copyMapToAncestor[A](map: Map[FormulaOccurrence, A]): Map[FormulaOccurrence, A]

    Permalink
  14. def copyMapToDescendant(old_p: LKProof, new_p: LKProof, map: Map[FormulaOccurrence, FormulaOccurrence]): HashMap[FormulaOccurrence, FormulaOccurrence]

    Permalink
  15. def copySetToAncestor(set: Set[FormulaOccurrence]): HashSet[FormulaOccurrence]

    Permalink
  16. def debug(msg: ⇒ String): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    Logger
  17. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  18. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  19. def error(msg: ⇒ String, e: Throwable): Nothing

    Permalink
    Attributes
    protected
    Definition Classes
    Logger
  20. def error(msg: ⇒ String): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    Logger
  21. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  22. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  23. def handleBinaryRule(proof: LKProof, p1: LKProof, p2: LKProof, a1: FormulaOccurrence, a2: FormulaOccurrence, m: FormulaOccurrence, computeLeftAux: (HOLFormula) ⇒ HOLFormula, computeRightAux: (HOLFormula) ⇒ HOLFormula, constructor: (LKProof, LKProof, FormulaOccurrence, FormulaOccurrence) ⇒ LKProof)(implicit symbol_map: Map[FormulaOccurrence, Stream[SymbolA]], inst_map: Map[FormulaOccurrence, List[LambdaExpression]], cut_ancs: Set[FormulaOccurrence]): (LKProof, HashMap[FormulaOccurrence, FormulaOccurrence])

    Permalink
  24. def handleContractionRule(proof: LKProof, p: LKProof, a1: FormulaOccurrence, a2: FormulaOccurrence, constructor: (LKProof, FormulaOccurrence, FormulaOccurrence) ⇒ LKProof)(implicit symbol_map: Map[FormulaOccurrence, Stream[SymbolA]], inst_map: Map[FormulaOccurrence, List[LambdaExpression]], cut_ancs: Set[FormulaOccurrence]): (LKProof, HashMap[FormulaOccurrence, FormulaOccurrence])

    Permalink
  25. def handleDefRule(proof: LKProof, p: LKProof, a: FormulaOccurrence, m: FormulaOccurrence, pol: Int, constructor: (LKProof, FormulaOccurrence, HOLFormula) ⇒ LKProof)(implicit symbol_map: Map[FormulaOccurrence, Stream[SymbolA]], inst_map: Map[FormulaOccurrence, List[LambdaExpression]], cut_ancs: Set[FormulaOccurrence]): (LKProof, HashMap[FormulaOccurrence, FormulaOccurrence])

    Permalink
  26. def handleEqRule(proof: LKProof, p1: LKProof, p2: LKProof, e: FormulaOccurrence, a: FormulaOccurrence, m: FormulaOccurrence, pol: Int, constructor: (LKProof, LKProof, FormulaOccurrence, FormulaOccurrence, HOLFormula) ⇒ LKProof)(implicit symbol_map: Map[FormulaOccurrence, Stream[SymbolA]], inst_map: Map[FormulaOccurrence, List[LambdaExpression]], cut_ancs: Set[FormulaOccurrence]): (LKProof, HashMap[FormulaOccurrence, FormulaOccurrence])

    Permalink
  27. def handleNegRule(proof: LKProof, p: LKProof, a: FormulaOccurrence, m: FormulaOccurrence, computeAux: (HOLFormula) ⇒ HOLFormula, constructor: (LKProof, FormulaOccurrence) ⇒ LKProof)(implicit symbol_map: Map[FormulaOccurrence, Stream[SymbolA]], inst_map: Map[FormulaOccurrence, List[LambdaExpression]], cut_ancs: Set[FormulaOccurrence]): (LKProof, HashMap[FormulaOccurrence, FormulaOccurrence])

    Permalink
  28. def handleStrongQuantRule(proof: LKProof, p: LKProof, a: FormulaOccurrence, m: FormulaOccurrence, v: Var, constructor: (LKProof, FormulaOccurrence, HOLFormula, Var) ⇒ LKProof)(implicit symbol_map: Map[FormulaOccurrence, Stream[SymbolA]], inst_map: Map[FormulaOccurrence, List[LambdaExpression]], cut_ancs: Set[FormulaOccurrence]): (LKProof, Map[FormulaOccurrence, FormulaOccurrence])

    Permalink
  29. def handleUnary1Rule(proof: LKProof, p: LKProof, a: FormulaOccurrence, m: FormulaOccurrence, pol: Int, mainConn: (LambdaExpression) ⇒ Option[(HOLFormula, HOLFormula)], computeAux: (HOLFormula) ⇒ HOLFormula, constructor: (LKProof, FormulaOccurrence, HOLFormula) ⇒ LKProof)(implicit symbol_map: Map[FormulaOccurrence, Stream[SymbolA]], inst_map: Map[FormulaOccurrence, List[LambdaExpression]], cut_ancs: Set[FormulaOccurrence]): (LKProof, HashMap[FormulaOccurrence, FormulaOccurrence])

    Permalink
  30. def handleUnary2Rule(proof: LKProof, p: LKProof, a: FormulaOccurrence, m: FormulaOccurrence, pol: Int, mainConn: (LambdaExpression) ⇒ Option[(HOLFormula, HOLFormula)], computeAux: (HOLFormula) ⇒ HOLFormula, constructor: (LKProof, HOLFormula, FormulaOccurrence) ⇒ LKProof)(implicit symbol_map: Map[FormulaOccurrence, Stream[SymbolA]], inst_map: Map[FormulaOccurrence, List[LambdaExpression]], cut_ancs: Set[FormulaOccurrence]): (LKProof, HashMap[FormulaOccurrence, FormulaOccurrence])

    Permalink
  31. def handleUnaryRule(proof: LKProof, p: LKProof, a: FormulaOccurrence, weak: HOLFormula, m: FormulaOccurrence, computeAux: (HOLFormula) ⇒ HOLFormula, constructor: (LKProof, FormulaOccurrence, HOLFormula) ⇒ LKProof, partition: (Stream[SymbolA]) ⇒ Stream[SymbolA])(implicit symbol_map: Map[FormulaOccurrence, Stream[SymbolA]], inst_map: Map[FormulaOccurrence, List[LambdaExpression]], cut_ancs: Set[FormulaOccurrence]): (LKProof, HashMap[FormulaOccurrence, FormulaOccurrence])

    Permalink
  32. def handleWeakQuantRule(proof: LKProof, p: LKProof, a: FormulaOccurrence, m: FormulaOccurrence, t: LambdaExpression, pol: Int, constructor: (LKProof, FormulaOccurrence, HOLFormula, LambdaExpression) ⇒ LKProof)(implicit symbol_map: Map[FormulaOccurrence, Stream[SymbolA]], inst_map: Map[FormulaOccurrence, List[LambdaExpression]], cut_ancs: Set[FormulaOccurrence]): (LKProof, HashMap[FormulaOccurrence, FormulaOccurrence])

    Permalink
  33. def handleWeakeningRule(proof: LKProof, p: LKProof, m: FormulaOccurrence, pol: Int, constructor: (LKProof, HOLFormula) ⇒ LKProof with PrincipalFormulas)(implicit symbol_map: Map[FormulaOccurrence, Stream[SymbolA]], inst_map: Map[FormulaOccurrence, List[LambdaExpression]], cut_ancs: Set[FormulaOccurrence]): (LKProof with PrincipalFormulas, HashMap[FormulaOccurrence, FormulaOccurrence])

    Permalink
  34. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  35. def info(msg: ⇒ String): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    Logger
  36. def invert(pol: Int): Int

    Permalink
  37. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  38. val log: Logger

    Permalink
    Attributes
    protected
    Definition Classes
    Logger
  39. def loggerName: String

    Permalink
    Attributes
    protected
    Definition Classes
    Logger
  40. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  41. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  42. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  43. def sk(f: HOLFormula, pol: Int, terms: List[LambdaExpression], symbols: Stream[SymbolA]): HOLFormula

    Permalink
  44. def skolemize(f: HOLFormula, pol: Int, symbols: Stream[SymbolA]): HOLFormula

    Permalink
  45. def skolemize(proof: LKProof, symbol_map: Map[FormulaOccurrence, Stream[SymbolA]], inst_map: Map[FormulaOccurrence, List[LambdaExpression]], cut_ancs: Set[FormulaOccurrence]): (LKProof, Map[FormulaOccurrence, FormulaOccurrence])

    Permalink
  46. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  47. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  48. def trace(msg: ⇒ String): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    Logger
  49. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  50. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  51. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  52. def warn(msg: ⇒ String, e: Throwable): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    Logger
  53. def warn(msg: ⇒ String): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    Logger

Inherited from Logger

Inherited from AnyRef

Inherited from Any

Ungrouped