fol2

gapt.examples.fol2
object fol2

Provides a simple intuitionistic proof of ¬p ∨ p ⊢ ¬¬p → p. Applying the CERES method will create a non-intuitionistic proof but reductive cut-elimination will always create an intuitionistic one. Therefore this is an example that CERES produces cut-free proofs which reductive cut-elimination cannot.

Attributes

Graph
Supertypes
class Object
trait Matchable
class Any
Self type
fol2.type

Members list

Value members

Concrete fields

val ax: LogicalAxiom
lazy val ceres_cutfree: LKProof
val cut_left: OrRightRule
val cut_right: ImpRightRule
val p1: NegLeftRule
val p2: NegRightRule
val p3: NegLeftRule
val p4: OrLeftRule
val p5: NegLeftRule
val p6: NegRightRule
val p7: OrLeftRule
val proof: CutRule
lazy val reductive_cutfree: LKProof