object set extends Theory
- Source
- set.scala
- Alphabetic
- By Inheritance
- set
- Theory
- Theory0
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Type Members
-
case class
LemmaHandle(proofName: Expr) extends Product with Serializable
Captures an LKProof together with the set of previous lemmas used in it.
Captures an LKProof together with the set of previous lemmas used in it.
- Definition Classes
- Theory
-
case class
indfn(constName: String, desc: Formula) extends LemmaHelper[Unit] with Product with Serializable
- Attributes
- protected
- Definition Classes
- Theory
-
case class
lemma(openFormula: Formula, attributes: String*) extends LemmaHelper[LemmaHandle] with Product with Serializable
- Attributes
- protected
- Definition Classes
- Theory
Value Members
-
object
LemmaHandle extends Serializable
- Definition Classes
- Theory
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
addNow(update: Update): Unit
- Attributes
- protected
- Definition Classes
- Theory0
-
def
addProof(name: Expr, proof: ⇒ LKProof): Unit
- Attributes
- protected
- Definition Classes
- Theory0
-
def
allProofs: Vector[(String, Eval[DelayedProofResult])]
- Definition Classes
- Theory
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
attr(attrNames: String*)(lemmaNames: String*): Unit
Adds a list of attributes to a list of lemmas.
Adds a list of attributes to a list of lemmas.
- Attributes
- protected
- Definition Classes
- Theory
-
def
axiom(f: Formula)(implicit name: Name): Unit
Adds a formula to this theory as an axiom.
Adds a formula to this theory as an axiom.
- Attributes
- protected
- Definition Classes
- Theory
- val bigintersectempty: LemmaHandle
- val bigunionempty: LemmaHandle
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
- val compcomp: LemmaHandle
-
def
const(c: Const): Unit
Adds a constant to this theory's context.
Adds a constant to this theory's context.
- Attributes
- protected
- Definition Classes
- Theory
-
implicit
def
ctx: Context
- Definition Classes
- Theory0
-
def
ctxWithProofDefinitions(): ImmutableContext
- Definition Classes
- Theory
-
implicit
def
curCtx: Context
- Attributes
- protected
- Definition Classes
- Theory
- val demorgan1: LemmaHandle
- val demorgan2: LemmaHandle
-
def
dfn(eqn: Formula): Unit
- Attributes
- protected
- Definition Classes
- Theory
- val emptycomp: LemmaHandle
- val emptyintersect1: LemmaHandle
- val emptyintersect2: LemmaHandle
- val emptysubset: LemmaHandle
- val emptyunion1: LemmaHandle
- val emptyunion2: LemmaHandle
- val emptyunique: LemmaHandle
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- val eqsubset: LemmaHandle
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- val extAxiom: Unit
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
def
fun(c: Const, equations: String*): Unit
- Attributes
- protected
- Definition Classes
- Theory
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
val
imports: List[Theory]
- Definition Classes
- Theory0
-
def
indTy(ty0: Ty, ctrs: Const*): Unit
- Attributes
- protected
- Definition Classes
- Theory
-
def
infix(operator: String, precedence: Int, leftAssociative: Boolean = true, const: String = null): Unit
Adds an operator as infix notation for an existing constant.
Adds an operator as infix notation for an existing constant.
- operator
The operator to add.
- precedence
The precedence of the operator.
- leftAssociative
Whether the operator associates to the left.
- const
The constant which the operator denotes. If nothing is supplied, it will assumed to have the same name as the operator.
- Attributes
- protected
- Definition Classes
- Theory
- val insertintersect: LemmaHandle
- val insertunion: LemmaHandle
- val insertuniv: LemmaHandle
- val intersectassoc: LemmaHandle
- val intersectcomm: LemmaHandle
- val intersectintersect: LemmaHandle
- val intersectuniondistrib: LemmaHandle
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
main(args: Array[String]): Unit
- Definition Classes
- Theory
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- val pairsetelem1: LemmaHandle
- val pairsetelem2: LemmaHandle
- val pairsetintersect: LemmaHandle
- val pairsetunion: LemmaHandle
-
def
proof(name: String): LKProof
- Definition Classes
- Theory
-
def
proofsHere: Vector[(String, Eval[DelayedProofResult])]
- Definition Classes
- Theory0
- val subsetintersect: LemmaHandle
- val subsetrefl: LemmaHandle
- val subsettrans: LemmaHandle
- val subsetunion: LemmaHandle
- val subsetuniv: LemmaHandle
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
val
transitiveImports: Vector[Theory]
- Definition Classes
- Theory
- val unionassoc: LemmaHandle
- val unioncomm: LemmaHandle
- val unionintersectdistrib: LemmaHandle
- val unionunion: LemmaHandle
- val univintersect1: LemmaHandle
- val univinterset2: LemmaHandle
- val univunion1: LemmaHandle
- val univunion2: LemmaHandle
- val univunique: LemmaHandle
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
This is the API documentation for GAPT.
The main package is at.logic.gapt.