Object

at.logic.gapt.proofs.ceres_schema.projections

Projections

Related Doc: package projections

Permalink

object Projections extends Logger

Source
projections.scala
Linear Supertypes
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Projections
  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(proof: LKProof, cut_ancs: Set[FormulaOccurrence], pred: (HOLFormula) ⇒ Boolean): Set[LKProof]

    Permalink
  5. def apply(proof: LKProof, pred: (HOLFormula) ⇒ Boolean): Set[LKProof]

    Permalink
  6. def apply(proof: LKProof): Set[LKProof]

    Permalink
  7. final def asInstanceOf[T0]: T0

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

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  9. def copySetToAncestor(set: Set[FormulaOccurrence]): Set[FormulaOccurrence]

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

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

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

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

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

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

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  16. def flipargs[A, B, C, D](f: (A, B, C) ⇒ D): (A, C, B) ⇒ D

    Permalink
  17. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  18. def getESAncs(proof: LKProof, cut_ancs: Set[FormulaOccurrence]): (Seq[FormulaOccurrence], Seq[FormulaOccurrence])

    Permalink
  19. def handleBinaryCutAnc(proof: LKProof, p1: LKProof, p2: LKProof, s1: Set[LKProof], s2: Set[LKProof], cut_ancs: Set[FormulaOccurrence]): Set[LKProof]

    Permalink
  20. def handleBinaryESAnc(proof: LKProof with AuxiliaryFormulas, parent1: LKProof, parent2: LKProof, s1: Set[LKProof], s2: Set[LKProof], constructor: (LKProof, LKProof, FormulaOccurrence, FormulaOccurrence) ⇒ LKProof): Set[LKProof]

    Permalink
  21. def handleBinaryRule(proof: LKProof, p1: LKProof, p2: LKProof, a1: FormulaOccurrence, a2: FormulaOccurrence, m: FormulaOccurrence, constructor: (LKProof, LKProof, FormulaOccurrence, FormulaOccurrence) ⇒ LKProof, pred: (HOLFormula) ⇒ Boolean)(implicit cut_ancs: Set[FormulaOccurrence]): Set[LKProof]

    Permalink
  22. def handleContractionRule(proof: LKProof, p: LKProof, a1: FormulaOccurrence, a2: FormulaOccurrence, m: FormulaOccurrence, constructor: (LKProof, FormulaOccurrence, FormulaOccurrence) ⇒ LKProof, pred: (HOLFormula) ⇒ Boolean)(implicit cut_ancs: Set[FormulaOccurrence]): Set[LKProof]

    Permalink
  23. def handleDefRule(proof: LKProof, p: LKProof, a: FormulaOccurrence, m: FormulaOccurrence, constructor: (LKProof, FormulaOccurrence, HOLFormula) ⇒ LKProof, pred: (HOLFormula) ⇒ Boolean)(implicit cut_ancs: Set[FormulaOccurrence]): Set[LKProof]

    Permalink
  24. def handleEqRule(proof: LKProof, p1: LKProof, p2: LKProof, a1: FormulaOccurrence, a2: FormulaOccurrence, m: FormulaOccurrence, constructor: (LKProof, LKProof, FormulaOccurrence, FormulaOccurrence, HOLFormula) ⇒ LKProof, pred: (HOLFormula) ⇒ Boolean)(implicit cut_ancs: Set[FormulaOccurrence]): Set[LKProof]

    Permalink
  25. def handleLKSKStrongQuantRule(proof: LKProof, p: LKProof, a: LabelledFormulaOccurrence, m: LabelledFormulaOccurrence, skolemterm: LambdaExpression, constructor: (LKProof, LabelledFormulaOccurrence, HOLFormula, LambdaExpression) ⇒ LKProof, pred: (HOLFormula) ⇒ Boolean)(implicit cut_ancs: Set[FormulaOccurrence]): Set[LKProof]

    Permalink
  26. def handleLKSKWeakQuantRule(proof: LKProof, p: LKProof, a: LabelledFormulaOccurrence, m: LabelledFormulaOccurrence, t: LambdaExpression, constructor: (LKProof, LabelledFormulaOccurrence, HOLFormula, LambdaExpression, Boolean) ⇒ LKProof, pred: (HOLFormula) ⇒ Boolean)(implicit cut_ancs: Set[FormulaOccurrence]): Set[LKProof]

    Permalink
  27. def handleLKSKWeakeningRule(proof: LKProof, p: LKProof, m: LabelledFormulaOccurrence, constructor: (LKProof, HOLFormula, Label) ⇒ LKProof with PrincipalFormulas, pred: (HOLFormula) ⇒ Boolean)(implicit cut_ancs: Set[FormulaOccurrence]): Set[LKProof]

    Permalink
  28. def handleNegRule(proof: LKProof, p: LKProof, a: FormulaOccurrence, m: FormulaOccurrence, constructor: (LKProof, FormulaOccurrence) ⇒ LKProof, pred: (HOLFormula) ⇒ Boolean)(implicit cut_ancs: Set[FormulaOccurrence]): Set[LKProof]

    Permalink
  29. def handleStrongQuantRule(proof: LKProof, p: LKProof, a: FormulaOccurrence, m: FormulaOccurrence, v: Var, constructor: (LKProof, HOLFormula, HOLFormula, Var) ⇒ LKProof, pred: (HOLFormula) ⇒ Boolean)(implicit cut_ancs: Set[FormulaOccurrence]): Set[LKProof]

    Permalink
  30. def handleUnaryImpRule(proof: LKProof, p: LKProof, a1: FormulaOccurrence, a2: FormulaOccurrence, m: FormulaOccurrence, constructor: (LKProof, FormulaOccurrence, FormulaOccurrence) ⇒ LKProof, pred: (HOLFormula) ⇒ Boolean)(implicit cut_ancs: Set[FormulaOccurrence]): Set[LKProof]

    Permalink
  31. def handleUnaryRule(proof: LKProof, p: LKProof, a: FormulaOccurrence, w: HOLFormula, m: FormulaOccurrence, constructor: (LKProof, FormulaOccurrence, HOLFormula) ⇒ LKProof, pred: (HOLFormula) ⇒ Boolean)(implicit cut_ancs: Set[FormulaOccurrence]): Set[LKProof]

    Permalink
  32. def handleWeakQuantRule(proof: LKProof, p: LKProof, a: FormulaOccurrence, m: FormulaOccurrence, t: LambdaExpression, constructor: (LKProof, FormulaOccurrence, HOLFormula, LambdaExpression) ⇒ LKProof, pred: (HOLFormula) ⇒ Boolean)(implicit cut_ancs: Set[FormulaOccurrence]): Set[LKProof]

    Permalink
  33. def handleWeakeningRule(proof: LKProof, p: LKProof, m: FormulaOccurrence, constructor: (LKProof, HOLFormula) ⇒ LKProof with PrincipalFormulas, pred: (HOLFormula) ⇒ Boolean)(implicit cut_ancs: Set[FormulaOccurrence]): Set[LKProof]

    Permalink
  34. def hashCode(): Int

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

    Permalink
    Attributes
    protected
    Definition Classes
    Logger
  36. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  37. def lksk_reflexivity_projection(proof: LKProof, t: Ty = Ti): LKProof

    Permalink
  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 pick(aux: FormulaOccurrence, candidates: Seq[FormulaOccurrence]): FormulaOccurrence

    Permalink
  44. def pick1(aux: FormulaOccurrence, candidates: Seq[FormulaOccurrence]): (FormulaOccurrence, Seq[FormulaOccurrence])

    Permalink
  45. def pick2(aux1: FormulaOccurrence, aux2: FormulaOccurrence, candidates: Seq[FormulaOccurrence]): List[FormulaOccurrence]

    Permalink
  46. def pickrule(p: LKProof, s: List[OccSequent], aux: List[FormulaOccurrence]): List[FormulaOccurrence]

    Permalink
  47. def reflexivity_projection(proof: LKProof, t: Ty = Ti): LKProof

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

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

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

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

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

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

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

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

    Permalink
    Attributes
    protected
    Definition Classes
    Logger
  56. def weakenESAncs(esancs: (Seq[FormulaOccurrence], Seq[FormulaOccurrence]), s: Set[LKProof]): Set[LKProof]

    Permalink

Inherited from Logger

Inherited from AnyRef

Inherited from Any

Ungrouped