class ReductiveCutElimination extends AnyRef
- Alphabetic
- By Inheritance
- ReductiveCutElimination
- AnyRef
- Any
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- Hide All
- Show All
- Public
- All
Instance Constructors
- new ReductiveCutElimination()
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
def
+(other: String): String
- Implicit
- This member is added by an implicit conversion from ReductiveCutElimination to any2stringadd[ReductiveCutElimination] performed by method any2stringadd in scala.Predef.
- Definition Classes
- any2stringadd
-
def
->[B](y: B): (ReductiveCutElimination, B)
- Implicit
- This member is added by an implicit conversion from ReductiveCutElimination to ArrowAssoc[ReductiveCutElimination] performed by method ArrowAssoc in scala.Predef.
- Definition Classes
- ArrowAssoc
- Annotations
- @inline()
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
apply(proof: LKProof, terminateReduction: (LKProof) ⇒ Boolean, reduction: (LKProof) ⇒ Option[(LKProof, SequentConnector)], cleanStructRules: Boolean = true): LKProof
Transforms a proof by applying a reduction until some specified criterion is satisfied.
Transforms a proof by applying a reduction until some specified criterion is satisfied.
- proof
The proof to which the transformation is applied.
- terminateReduction
A predicate which decides on the current global proof whether the transformation has reached its final state.
- reduction
A local reduction function.
- cleanStructRules
Indicates whether structural rules are cleaned after each step.
- returns
A proof that is obtained from the given proof by applying the reduction function iteratively and simultaneously to all lowermost redexes of the current proof until the specified criterion is satisfied.
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
def
eliminateAllByUppermost(proof: LKProof, cleanStructRules: Boolean = true): LKProof
This methods implements a version of Gentzen's cut-elimination proof using the (known to be terminating) strategy of reducing a left-uppermost cut.
This methods implements a version of Gentzen's cut-elimination proof using the (known to be terminating) strategy of reducing a left-uppermost cut. The algorithm terminates when all cuts have been eliminated.
- proof
The proof to subject to cut-elimination.
- cleanStructRules
Tells algorithm to clean struct rules or not. Default is on
- returns
The cut-free proof.
-
def
eliminateInduction(proof: LKProof, cleanStructRules: Boolean = true)(implicit ctx: Context): LKProof
Eliminates inductions from a proof.
Eliminates inductions from a proof.
- proof
The proof to which the transformation is applied.
- cleanStructRules
Indicates whether structural rules are cleaned during the reduction.
- ctx
Defines constants, types, etc.
- returns
A proof obtained by repeated application of induction unfolding; equality reduction and free-cut elimination. The reduction ends if there is no more unfoldable induction i.e. there is no induction inference with constructor form induction term.
-
def
eliminateToACNFByUppermost(proof: LKProof, cleanStructRules: Boolean = true): LKProof
This algorithm implements a generalization of the Gentzen method which reduces all cuts to atomic cuts.
This algorithm implements a generalization of the Gentzen method which reduces all cuts to atomic cuts.
- proof
The proof to subject to cut-elimination.
- cleanStructRules
Tells algorithm to clean struct rules or not. Default is on
- returns
The cut-free proof.
-
def
eliminateToACNFTopByUppermost(proof: LKProof, cleanStructRules: Boolean = true): LKProof
This algorithm implements a generalization of the Gentzen method which reduces all cuts to atomic cuts and pushes these cuts to the leaves of the proof.
This algorithm implements a generalization of the Gentzen method which reduces all cuts to atomic cuts and pushes these cuts to the leaves of the proof.
- proof
The proof to subject to cut-elimination.
- cleanStructRules
Tells algorithm to clean struct rules or not. Default is on
- returns
The cut-free proof.
-
def
ensuring(cond: (ReductiveCutElimination) ⇒ Boolean, msg: ⇒ Any): ReductiveCutElimination
- Implicit
- This member is added by an implicit conversion from ReductiveCutElimination to Ensuring[ReductiveCutElimination] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
-
def
ensuring(cond: (ReductiveCutElimination) ⇒ Boolean): ReductiveCutElimination
- Implicit
- This member is added by an implicit conversion from ReductiveCutElimination to Ensuring[ReductiveCutElimination] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
-
def
ensuring(cond: Boolean, msg: ⇒ Any): ReductiveCutElimination
- Implicit
- This member is added by an implicit conversion from ReductiveCutElimination to Ensuring[ReductiveCutElimination] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
-
def
ensuring(cond: Boolean): ReductiveCutElimination
- Implicit
- This member is added by an implicit conversion from ReductiveCutElimination to Ensuring[ReductiveCutElimination] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
def
formatted(fmtstr: String): String
- Implicit
- This member is added by an implicit conversion from ReductiveCutElimination to StringFormat[ReductiveCutElimination] performed by method StringFormat in scala.Predef.
- Definition Classes
- StringFormat
- Annotations
- @inline()
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
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()
- var recordSteps: Boolean
- val steps: Buffer[LKProof]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
def
unfoldInductions(proof: LKProof, cleanStructRules: Boolean = true)(implicit ctx: Context): LKProof
Unfolds all induction inference with induction term in constructor form.
Unfolds all induction inference with induction term in constructor form.
- proof
The proof to which this transformation is applied.
- cleanStructRules
Indicates whether the structural rules are cleaned during the reduction.
- ctx
Defines constants, inductive types, etc.
- returns
A proof of the same end-sequent which contains no induction inference with induction term in constructor form.
-
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( ... )
-
def
→[B](y: B): (ReductiveCutElimination, B)
- Implicit
- This member is added by an implicit conversion from ReductiveCutElimination to ArrowAssoc[ReductiveCutElimination] performed by method ArrowAssoc in scala.Predef.
- Definition Classes
- ArrowAssoc
This is the API documentation for GAPT.
The main package is at.logic.gapt.