at
.
logic
.
gapt
.
proofs
.
ceres
.
projections
Projections
Related Doc:
package projections
object
Projections
extends
Logger
Linear Supertypes
Logger
,
AnyRef
,
Any
Ordering
Alphabetic
By inheritance
Inherited
Projections
Logger
AnyRef
Any
Hide All
Show all
Visibility
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
,
cut_ancs:
Set
[
FormulaOccurrence
]
,
pred: (
HOLFormula
) ⇒
Boolean
)
:
Set
[
LKProof
]
def
apply
(
proof:
LKProof
,
pred: (
HOLFormula
) ⇒
Boolean
)
:
Set
[
LKProof
]
def
apply
(
proof:
LKProof
)
:
Set
[
LKProof
]
final
def
asInstanceOf
[
T0
]
:
T0
Definition Classes
Any
def
clone
()
:
AnyRef
Attributes
protected[
java.lang
]
Definition Classes
AnyRef
Annotations
@throws
(
...
)
def
copySetToAncestor
(
set:
Set
[
FormulaOccurrence
]
)
:
Set
[
FormulaOccurrence
]
def
debug
(
msg: ⇒
String
)
:
Unit
Attributes
protected
Definition Classes
Logger
final
def
eq
(
arg0:
AnyRef
)
:
Boolean
Definition Classes
AnyRef
def
equals
(
arg0:
Any
)
:
Boolean
Definition Classes
AnyRef → Any
def
error
(
msg: ⇒
String
,
e:
Throwable
)
:
Nothing
Attributes
protected
Definition Classes
Logger
def
error
(
msg: ⇒
String
)
:
Unit
Attributes
protected
Definition Classes
Logger
def
finalize
()
:
Unit
Attributes
protected[
java.lang
]
Definition Classes
AnyRef
Annotations
@throws
(
classOf[java.lang.Throwable]
)
def
flipargs
[
A
,
B
,
C
,
D
]
(
f: (
A
,
B
,
C
) ⇒
D
)
: (
A
,
C
,
B
) ⇒
D
final
def
getClass
()
:
Class
[_]
Definition Classes
AnyRef → Any
def
getESAncs
(
proof:
LKProof
,
cut_ancs:
Set
[
FormulaOccurrence
]
)
: (
Seq
[
FormulaOccurrence
],
Seq
[
FormulaOccurrence
])
def
handleBinaryCutAnc
(
proof:
LKProof
,
p1:
LKProof
,
p2:
LKProof
,
s1:
Set
[
LKProof
]
,
s2:
Set
[
LKProof
]
,
cut_ancs:
Set
[
FormulaOccurrence
]
)
:
Set
[
LKProof
]
def
handleBinaryESAnc
(
proof:
LKProof
with
AuxiliaryFormulas
,
parent1:
LKProof
,
parent2:
LKProof
,
s1:
Set
[
LKProof
]
,
s2:
Set
[
LKProof
]
,
constructor: (
LKProof
,
LKProof
,
FormulaOccurrence
,
FormulaOccurrence
) ⇒
LKProof
)
:
Set
[
LKProof
]
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
]
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
]
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
]
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
]
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
]
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
]
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
]
def
handleNegRule
(
proof:
LKProof
,
p:
LKProof
,
a:
FormulaOccurrence
,
m:
FormulaOccurrence
,
constructor: (
LKProof
,
FormulaOccurrence
) ⇒
LKProof
,
pred: (
HOLFormula
) ⇒
Boolean
)
(
implicit
cut_ancs:
Set
[
FormulaOccurrence
]
)
:
Set
[
LKProof
]
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
]
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
]
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
]
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
]
def
handleWeakeningRule
(
proof:
LKProof
,
p:
LKProof
,
m:
FormulaOccurrence
,
constructor: (
LKProof
,
HOLFormula
) ⇒
LKProof
with
PrincipalFormulas
,
pred: (
HOLFormula
) ⇒
Boolean
)
(
implicit
cut_ancs:
Set
[
FormulaOccurrence
]
)
:
Set
[
LKProof
]
def
hashCode
()
:
Int
Definition Classes
AnyRef → Any
def
info
(
msg: ⇒
String
)
:
Unit
Attributes
protected
Definition Classes
Logger
final
def
isInstanceOf
[
T0
]
:
Boolean
Definition Classes
Any
def
lksk_reflexivity_projection
(
proof:
LKProof
,
t:
TA
=
Ti
)
:
LKProof
val
log
:
Logger
Attributes
protected
Definition Classes
Logger
def
loggerName
:
String
Attributes
protected
Definition Classes
Logger
final
def
ne
(
arg0:
AnyRef
)
:
Boolean
Definition Classes
AnyRef
final
def
notify
()
:
Unit
Definition Classes
AnyRef
final
def
notifyAll
()
:
Unit
Definition Classes
AnyRef
def
pick
(
aux:
FormulaOccurrence
,
candidates:
Seq
[
FormulaOccurrence
]
)
:
FormulaOccurrence
def
pick1
(
aux:
FormulaOccurrence
,
candidates:
Seq
[
FormulaOccurrence
]
)
: (
FormulaOccurrence
,
Seq
[
FormulaOccurrence
])
def
pick2
(
aux1:
FormulaOccurrence
,
aux2:
FormulaOccurrence
,
candidates:
Seq
[
FormulaOccurrence
]
)
:
List
[
FormulaOccurrence
]
def
pickrule
(
p:
LKProof
,
s:
List
[
OccSequent
]
,
aux:
List
[
FormulaOccurrence
]
)
:
List
[
FormulaOccurrence
]
def
reflexivity_projection
(
proof:
LKProof
,
t:
TA
=
Ti
)
:
LKProof
final
def
synchronized
[
T0
]
(
arg0: ⇒
T0
)
:
T0
Definition Classes
AnyRef
def
toString
()
:
String
Definition Classes
AnyRef → Any
def
trace
(
msg: ⇒
String
)
:
Unit
Attributes
protected
Definition Classes
Logger
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
warn
(
msg: ⇒
String
,
e:
Throwable
)
:
Unit
Attributes
protected
Definition Classes
Logger
def
warn
(
msg: ⇒
String
)
:
Unit
Attributes
protected
Definition Classes
Logger
def
weakenESAncs
(
esancs: (
Seq
[
FormulaOccurrence
],
Seq
[
FormulaOccurrence
])
,
s:
Set
[
LKProof
]
)
:
Set
[
LKProof
]
Inherited from
Logger
Inherited from
AnyRef
Inherited from
Any
Ungrouped