N
findsip vtrat_comparison
Name
BabelLexical InferenceParser
NameGenerator
utils
NameMap
TPTPHOLExporter
NaturalNumberInductionRule
lk
Neg
expr BabelParserCombinators ast ast
NegC
expr
NegLeft
lkskNew
NegLeftRule
lk lkOld
NegLeftRuleType
lkOld
NegLeftTactic
tactics
NegRight
lkskNew
NegRightRule
lk lkOld
NegRightRuleType
lkOld
NegRightTactic
tactics
NewLabel
gaptic
NewLabels
gaptic
NewSymbol
ivy
NodeReader
XMLReaders
NodeSelectedEvent
prooftool
NonLogicalConstant
expr
NonTerminalNodeA
trees
NonTerminalVect
VectTratGrammar
Not
expr
NullaryAGraphProof
proofs
NullaryLKProof
base
NullaryProof
proofs
NullaryPropConnectiveHelper
expr
NullaryRuleTypeA
proofs
NullaryTreeProof
proofs
Num
InferenceParser
NumLabel
TreeListPanel
Numeral
fol
n
patchingSolFinder TreeListPanel
nAry
MonoidalBinaryPropConnectiveHelper
nTape
examples
nTape2
examples
nTape3
examples
nTape4
examples
nTape5
examples
nTape5Arith
examples
nTape6
examples
naive
fol
name
ExternalReforestMethod GrammarFindingMethod MaxSATMethod ReforestMethod ProofSequence Const LogicalC TBase Var IndexedVarSymbol BaseType Ident LeanCoPParser LAtom AToken RToken AToken RToken Var TPTPParser GTFun VeriTParser DeltaTableMethod DeltaTableMethodOld DagProof ProjectionSetSymbol ResolutionProofSchema clauseSchema clauseSetTerm sClauseVar sclTermVar ClauseSetSymbol AndLeftRule AndRightRule BottomAxiom ContractionLeftRule ContractionRightRule CutRule DefinitionLeftRule DefinitionRightRule EqualityLeftRule EqualityRightRule ExistsLeftRule ExistsRightRule ForallLeftRule ForallRightRule ImpLeftRule ImpRightRule InductionRule InitialSequent NegLeftRule NegRightRule OrLeftRule OrRightRule TopAxiom WeakeningLeftRule WeakeningRightRule LKBinaryRuleCreationException LKUnaryRuleCreationException SchemaProof ProofToolViewer RegressionTestCase Step AGraph ArbitraryAGraph BinaryAGraph LeafAGraph UnaryAGraph Tree
nameGen
ExprNameGenerator
nameRegex
NameGenerator
nameToLatexString
UnicodeToLatex toLatexString toLatexString
names
TToken TToken
neg
prenexify LeanCoPParser TPTPParser
negL
TacticCommands
negR
TacticCommands
negation
LatexReplacementParser LLKASTParser LatexReplacementParser Prover9TermParserA
negative
RichClause
negatom
Prover9TermParserA
nest
BabelExporter
nested
ProjectionException ProjectionException ProjectionException
neutral
MonoidalBinaryPropConnectiveHelper
newAtom
Definition
newFormulas
AllLeft AllRight AllSkRight AndLeft AndRight Equality ExLeft ExRight ExSkLeft ImpLeft ImpRight NegLeft NegRight OrLeft OrRight SameLabel RalAllF RalAndF RalAndT1 RalAndT2 RalBottomT RalExT RalImpF1 RalImpF2 RalImpT RalNegF RalNegT RalOrF1 RalOrF2 RalOrT RalTopF
newLabel
RenameTactic
newLabelledFormulas
RalAllT RalExF
newLit
Paramodulation
new_proofs
ProjectionException ProjectionException ProjectionException
new_symbol
NewSymbol
newlyDerived
EscargotLoop
nfG
vtrat_comparison
nfGrammar
findsip
nfRecSchem
sip_comparison vtrat_comparison
nfSipG
sip_comparison
niceName
PTContentPanel
noMatch
EqC LogicalC MonomorphicLogicalC QuantifierC EpsilonC
node
NodeSelectedEvent ArbitraryTree BinaryTree LeafTree NonTerminalNodeA TerminalNodeA UnaryTree
nodes
AGraph
nodesToAbstractTerms
XMLUtils
nodesToFormulas
XMLUtils
nonEmpty
Sequent
nonTerminalLengths
MaxSATMethod
nonTerminals
RecSchemTemplate RecursionScheme TratGrammar VectTratGrammar
nonVarSclause
clauseSchema
noneOf
exactly exactly
noniterm
Prover9TermParserA
norm
LankfordSolverInstance
normalize
TokenToLKConverter TokenToLKConverter StandardClauseSet
normalizeFSequent
Prover9TermParserA
normalizeFormula
Prover9TermParserA
normalizeFreeVariables
hol
notDefault
expr
notFormula
VeriTParser
notSpecific
expr
not_and
VeriTParser
not_eq
LeanCoPParser TPTPParser
not_implies1
VeriTParser
not_implies2
VeriTParser
not_or
VeriTParser
nu
FactorialFunctionEqualityExampleProof2 SipGrammar SimpleInductionProof
numFuns
TermSetStats
numLabels
TreeListPanel
numOfAtoms
hol
numVars
SchematicExtendedHerbrandSequent
number
NumLabel
numberOfInstancesET
expansion
numberOfLogicalInferencesRes
resolution
numberOfPairs
DeltaTable
numeral
Utils