object cleanStructuralRules
- Alphabetic
- By Inheritance
- cleanStructuralRules
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Value Members
-
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
apply(proof: LKProof, reductive: Boolean = true): LKProof
"Cleans up" a proof by permuting weakenings downward as far as possible.
"Cleans up" a proof by permuting weakenings downward as far as possible.
- proof
The LKProof to be transformed.
- reductive
Whether the algorithm is allowed to discard "unnecessary" subproofs. True by default.
- returns
A proof of the same end sequent (up to a permutation) in which all weakenings are performed as late as possible.
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
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] )
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
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
- @throws( ... )
-
def
withSequentConnector(proof: LKProof, reductive: Boolean = true): (LKProof, SequentConnector)
"Cleans up" a proof by permuting weakenings downward as far as possible.
"Cleans up" a proof by permuting weakenings downward as far as possible.
- proof
The LKProof to be transformed.
- reductive
Whether the algorithm is allowed to discard "unnecessary" subproofs. True by default.
- returns
A proof of the same end sequent (up to a permutation) in which all weakenings are performed as late as possible; and an SequentConnector relating the end sequents of the old and new proofs.