at
.
logic
.
gapt
.
proofs
.
lkOld
skolemize
Related Doc:
package lkOld
object
skolemize
extends
Logger
Source
skolemization.scala
Linear Supertypes
Logger
,
AnyRef
,
Any
Ordering
Alphabetic
By Inheritance
Inherited
skolemize
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
(
f:
FOLFormula
,
pol:
Int
,
symbols:
Stream
[
String
]
)
:
FOLFormula
def
apply
(
f:
FOLFormula
,
pol:
Int
)
:
FOLFormula
def
apply
(
f:
HOLFormula
,
pol:
Int
,
symbols:
Stream
[
String
]
)
:
HOLFormula
def
apply
(
f:
HOLFormula
,
pol:
Int
)
:
HOLFormula
def
apply
(
fs:
HOLSequent
)
:
HOLSequent
def
apply
(
p:
LKProof
)
:
LKProof
final
def
asInstanceOf
[
T0
]
:
T0
Definition Classes
Any
def
clone
()
:
AnyRef
Attributes
protected[
java.lang
]
Definition Classes
AnyRef
Annotations
@throws
(
...
)
def
copyMap
(
old_p:
LKProof
,
new_p:
LKProof
,
map:
Map
[
FormulaOccurrence
,
FormulaOccurrence
]
)
:
Map
[
FormulaOccurrence
,
FormulaOccurrence
]
def
copyMapToAncestor
[
A
]
(
map:
Map
[
FormulaOccurrence
,
A
]
)
:
Map
[
FormulaOccurrence
,
A
]
def
copyMapToDescendant
(
old_p:
LKProof
,
new_p:
LKProof
,
map:
Map
[
FormulaOccurrence
,
FormulaOccurrence
]
)
:
HashMap
[
FormulaOccurrence
,
FormulaOccurrence
]
def
copySetToAncestor
(
set:
Set
[
FormulaOccurrence
]
)
:
HashSet
[
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]
)
final
def
getClass
()
:
Class
[_]
Definition Classes
AnyRef → Any
def
handleBinaryRule
(
proof:
LKProof
,
p1:
LKProof
,
p2:
LKProof
,
a1:
FormulaOccurrence
,
a2:
FormulaOccurrence
,
m:
FormulaOccurrence
,
computeLeftAux: (
HOLFormula
) ⇒
HOLFormula
,
computeRightAux: (
HOLFormula
) ⇒
HOLFormula
,
constructor: (
LKProof
,
LKProof
,
FormulaOccurrence
,
FormulaOccurrence
) ⇒
LKProof
)
(
implicit
symbol_map:
Map
[
FormulaOccurrence
,
Stream
[
String
]]
,
inst_map:
Map
[
FormulaOccurrence
,
List
[
LambdaExpression
]]
,
cut_ancs:
Set
[
FormulaOccurrence
]
)
: (
LKProof
,
HashMap
[
FormulaOccurrence
,
FormulaOccurrence
])
def
handleContractionRule
(
proof:
LKProof
,
p:
LKProof
,
a1:
FormulaOccurrence
,
a2:
FormulaOccurrence
,
constructor: (
LKProof
,
FormulaOccurrence
,
FormulaOccurrence
) ⇒
LKProof
)
(
implicit
symbol_map:
Map
[
FormulaOccurrence
,
Stream
[
String
]]
,
inst_map:
Map
[
FormulaOccurrence
,
List
[
LambdaExpression
]]
,
cut_ancs:
Set
[
FormulaOccurrence
]
)
: (
LKProof
,
HashMap
[
FormulaOccurrence
,
FormulaOccurrence
])
def
handleDefRule
(
proof:
LKProof
,
p:
LKProof
,
a:
FormulaOccurrence
,
m:
FormulaOccurrence
,
pol:
Int
,
constructor: (
LKProof
,
FormulaOccurrence
,
HOLFormula
) ⇒
LKProof
)
(
implicit
symbol_map:
Map
[
FormulaOccurrence
,
Stream
[
String
]]
,
inst_map:
Map
[
FormulaOccurrence
,
List
[
LambdaExpression
]]
,
cut_ancs:
Set
[
FormulaOccurrence
]
)
: (
LKProof
,
HashMap
[
FormulaOccurrence
,
FormulaOccurrence
])
def
handleEqRule
(
proof:
LKProof
,
p1:
LKProof
,
p2:
LKProof
,
e:
FormulaOccurrence
,
a:
FormulaOccurrence
,
m:
FormulaOccurrence
,
pol:
Int
,
constructor: (
LKProof
,
LKProof
,
FormulaOccurrence
,
FormulaOccurrence
,
HOLFormula
) ⇒
LKProof
)
(
implicit
symbol_map:
Map
[
FormulaOccurrence
,
Stream
[
String
]]
,
inst_map:
Map
[
FormulaOccurrence
,
List
[
LambdaExpression
]]
,
cut_ancs:
Set
[
FormulaOccurrence
]
)
: (
LKProof
,
HashMap
[
FormulaOccurrence
,
FormulaOccurrence
])
def
handleNegRule
(
proof:
LKProof
,
p:
LKProof
,
a:
FormulaOccurrence
,
m:
FormulaOccurrence
,
computeAux: (
HOLFormula
) ⇒
HOLFormula
,
constructor: (
LKProof
,
FormulaOccurrence
) ⇒
LKProof
)
(
implicit
symbol_map:
Map
[
FormulaOccurrence
,
Stream
[
String
]]
,
inst_map:
Map
[
FormulaOccurrence
,
List
[
LambdaExpression
]]
,
cut_ancs:
Set
[
FormulaOccurrence
]
)
: (
LKProof
,
HashMap
[
FormulaOccurrence
,
FormulaOccurrence
])
def
handleStrongQuantRule
(
proof:
LKProof
,
p:
LKProof
,
a:
FormulaOccurrence
,
m:
FormulaOccurrence
,
v:
Var
,
constructor: (
LKProof
,
FormulaOccurrence
,
HOLFormula
,
Var
) ⇒
LKProof
)
(
implicit
symbol_map:
Map
[
FormulaOccurrence
,
Stream
[
String
]]
,
inst_map:
Map
[
FormulaOccurrence
,
List
[
LambdaExpression
]]
,
cut_ancs:
Set
[
FormulaOccurrence
]
)
: (
LKProof
,
Map
[
FormulaOccurrence
,
FormulaOccurrence
])
def
handleUnary1Rule
(
proof:
LKProof
,
p:
LKProof
,
a:
FormulaOccurrence
,
m:
FormulaOccurrence
,
pol:
Int
,
mainConn: (
LambdaExpression
) ⇒
Option
[(
HOLFormula
,
HOLFormula
)]
,
computeAux: (
HOLFormula
) ⇒
HOLFormula
,
constructor: (
LKProof
,
FormulaOccurrence
,
HOLFormula
) ⇒
LKProof
)
(
implicit
symbol_map:
Map
[
FormulaOccurrence
,
Stream
[
String
]]
,
inst_map:
Map
[
FormulaOccurrence
,
List
[
LambdaExpression
]]
,
cut_ancs:
Set
[
FormulaOccurrence
]
)
: (
LKProof
,
HashMap
[
FormulaOccurrence
,
FormulaOccurrence
])
def
handleUnary2Rule
(
proof:
LKProof
,
p:
LKProof
,
a:
FormulaOccurrence
,
m:
FormulaOccurrence
,
pol:
Int
,
mainConn: (
LambdaExpression
) ⇒
Option
[(
HOLFormula
,
HOLFormula
)]
,
computeAux: (
HOLFormula
) ⇒
HOLFormula
,
constructor: (
LKProof
,
HOLFormula
,
FormulaOccurrence
) ⇒
LKProof
)
(
implicit
symbol_map:
Map
[
FormulaOccurrence
,
Stream
[
String
]]
,
inst_map:
Map
[
FormulaOccurrence
,
List
[
LambdaExpression
]]
,
cut_ancs:
Set
[
FormulaOccurrence
]
)
: (
LKProof
,
HashMap
[
FormulaOccurrence
,
FormulaOccurrence
])
def
handleUnaryRule
(
proof:
LKProof
,
p:
LKProof
,
a:
FormulaOccurrence
,
weak:
HOLFormula
,
m:
FormulaOccurrence
,
computeAux: (
HOLFormula
) ⇒
HOLFormula
,
constructor: (
LKProof
,
FormulaOccurrence
,
HOLFormula
) ⇒
LKProof
,
partition: (
Stream
[
String
]) ⇒
Stream
[
String
]
)
(
implicit
symbol_map:
Map
[
FormulaOccurrence
,
Stream
[
String
]]
,
inst_map:
Map
[
FormulaOccurrence
,
List
[
LambdaExpression
]]
,
cut_ancs:
Set
[
FormulaOccurrence
]
)
: (
LKProof
,
HashMap
[
FormulaOccurrence
,
FormulaOccurrence
])
def
handleWeakQuantRule
(
proof:
LKProof
,
p:
LKProof
,
a:
FormulaOccurrence
,
m:
FormulaOccurrence
,
t:
LambdaExpression
,
pol:
Int
,
constructor: (
LKProof
,
FormulaOccurrence
,
HOLFormula
,
LambdaExpression
) ⇒
LKProof
)
(
implicit
symbol_map:
Map
[
FormulaOccurrence
,
Stream
[
String
]]
,
inst_map:
Map
[
FormulaOccurrence
,
List
[
LambdaExpression
]]
,
cut_ancs:
Set
[
FormulaOccurrence
]
)
: (
LKProof
,
HashMap
[
FormulaOccurrence
,
FormulaOccurrence
])
def
handleWeakeningRule
(
proof:
LKProof
,
p:
LKProof
,
m:
FormulaOccurrence
,
pol:
Int
,
constructor: (
LKProof
,
HOLFormula
) ⇒
LKProof
with
PrincipalFormulas
)
(
implicit
symbol_map:
Map
[
FormulaOccurrence
,
Stream
[
String
]]
,
inst_map:
Map
[
FormulaOccurrence
,
List
[
LambdaExpression
]]
,
cut_ancs:
Set
[
FormulaOccurrence
]
)
: (
LKProof
with
PrincipalFormulas
,
HashMap
[
FormulaOccurrence
,
FormulaOccurrence
])
def
hashCode
()
:
Int
Definition Classes
AnyRef → Any
def
info
(
msg: ⇒
String
)
:
Unit
Attributes
protected
Definition Classes
Logger
def
invert
(
pol:
Int
)
:
Int
final
def
isInstanceOf
[
T0
]
:
Boolean
Definition Classes
Any
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
sk
(
f:
HOLFormula
,
pol:
Int
,
terms:
List
[
LambdaExpression
]
,
symbols:
Stream
[
String
]
)
:
HOLFormula
def
skolemize
(
f:
HOLFormula
,
pol:
Int
,
symbols:
Stream
[
String
]
)
:
HOLFormula
def
skolemize
(
proof:
LKProof
,
symbol_map:
Map
[
FormulaOccurrence
,
Stream
[
String
]]
,
inst_map:
Map
[
FormulaOccurrence
,
List
[
LambdaExpression
]]
,
cut_ancs:
Set
[
FormulaOccurrence
]
)
: (
LKProof
,
Map
[
FormulaOccurrence
,
FormulaOccurrence
])
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
Inherited from
Logger
Inherited from
AnyRef
Inherited from
Any
Ungrouped